References
- 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 https://doi.org/10.1007/BF01581273
- 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 https://doi.org/10.1287/mnsc.42.9.1229
- 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
- Ceria S., G. Cornuejols, and M. Dawande, 'Combining and strengthening Gomory cuts,' Proceedings of 4th International IPCO Conference, 1995, 438-451 https://doi.org/10.1007/3-540-59408-6_71
- CPLEX version 6.2, Using the CPLEX callable library, CPLEX Optimization, Inc., 1998
- 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 https://doi.org/10.1016/0377-2217(94)90250-X
- Glover F., 'Generalized cuts in Diophantine programming,' Management Science 13 (1966), 254-268 https://doi.org/10.1287/mnsc.13.3.254
- 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 https://doi.org/10.1023/A:1008621204567
- Gomory R. E., 'Outline of an algorithm for integer solutions to linear programs,' Operations Research 23 (1975), 434-451 https://doi.org/10.1287/opre.23.3.434
- Nemhauser G. L., and L. A. Wolsey, Integer and combinatorial optimization. John Wiley & Sons: New York, N.Y., 1988
- Sherali, H. D. and C. M. Shetty, 'On the generation of deep disjunctive cutting planes,' Naval Research Logistics Quarterly 27,3 (1980), 453-475 https://doi.org/10.1002/nav.3800270310