Generation of covering and partition test problems
Tài liệu tham khảo
Korbut, 1969
Garfinkel, 1972
Papadimitriou, 1982
Babayev, 1985, Construction of test problems for integer programming with binary unknowns, Zh. Vychisl. Mat. mat. Fiz., 25, 146
Babayev, 1985, Investigation of a certain class of power-input optimization problems
Fulkerson, 1974, Two computationally difficult set covering problems that arise in computing the l-width of incidence matrices of Steiner triple systems, Math. Programming Studies, 2, 72, 10.1007/BFb0120689
Ho, 1982, Worst case analyses of a class of set covering heuristics, Math. Programming, 23, 170, 10.1007/BF01583786
Williams, 1983, A reduction procedure for linear and integer programming models, Lecture Notes. Econ. Math. Systems, 206, 87, 10.1007/978-3-642-45535-3_9