1 |
Bixby R. E., E. A. Boyd, S. S. Dadmehr, and R. R. Indovina, The MIPLIB mixed integer library, Technical Report R92-36, Rice University, 1992
|
2 |
Ceria S., G. Cornuejols, and M. Dawande, 'Combining and strengthening Gomory cuts,' Proceedings of 4th International IPCO Conference, 1995, 438-451
DOI
ScienceOn
|
3 |
Nemhauser G. L., and L. A. Wolsey, Integer and combinatorial optimization. John Wiley & Sons: New York, N.Y., 1988
|
4 |
Balas, E., S. Ceria, and G. Cornuejols, 'A lift-and-project cutting plane algorithm for mixed 0-1 programs,' Mathematical Programming 58 (1993) 295-324
DOI
|
5 |
Sherali, H. D. and C. M. Shetty, 'On the generation of deep disjunctive cutting planes,' Naval Research Logistics Quarterly 27,3 (1980), 453-475
DOI
|
6 |
CPLEX version 6.2, Using the CPLEX callable library, CPLEX Optimization, Inc., 1998
|
7 |
Glover F., H. D. Sherali, and Y. Lee, 'Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming,' Computational Optimization and Applications 8 (1997), 151-172
DOI
|
8 |
Gomory R. E., 'Outline of an algorithm for integer solutions to linear programs,' Operations Research 23 (1975), 434-451
DOI
ScienceOn
|
9 |
Balas, E., S. Ceria, and G. Cornuejols, 'Mixed 0-1 programming by lift-and-project in a branch-and-cut framework,' Management Science 42 (1995) 1229-1246
DOI
ScienceOn
|
10 |
Dietrich B. L., and L. F. Escudero, 'Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts,' European Journal of Operational Research 73 (1994), 539-546
DOI
ScienceOn
|
11 |
Glover F., 'Generalized cuts in Diophantine programming,' Management Science 13 (1966), 254-268
DOI
ScienceOn
|