References
- Capara, A. and M. Fishetti, "{0, 1/2}-Chvatal-Gomory Cuts," Mathematical Programming, Vol.74, No.3(1996), pp.221-235. https://doi.org/10.1007/BF02592196
- Capara, A., M. Fishetti, and A.N. Letchford, "On the Separation of Maximally Violated mod-k Cuts," Mathematical Programming, Vol.87, No.1 (2000), pp.37-56. https://doi.org/10.1007/s101079900107
- Dash, S., O. Gunluk, and A. Lodi, "MIR Closures of Polyhedral Sets," Mathematical Programming, Vol.121, No.1(2010), pp.33-60. https://doi.org/10.1007/s10107-008-0225-x
- Daskin, M.S., Network and Discrete Location : Models, Algorithms, and Applications, Wiley, 1995.
- Eisenbrand, F., "On the Membership Problem for the Elementary Closure of a Polyhedron," Combinatorica, Vol.19, No.2(1999), pp.297-300. https://doi.org/10.1007/s004930050057
- Fischetti, M. and A. Lodi, "Optimizing over the first Chvatal Closure," Mathematical Programming, Vol.110, No.1(1999), pp.3-20.
- Glover, F., H.D. Sherali, and Y. Lee, "Generating Cuts from Surrogate Contraint Analysis for Zero-One and Multiple Choice Programming," Computational Optimization and Application, Vol.8(1997), pp.151-172. https://doi.org/10.1023/A:1008621204567
- Lee, K. and S. Park, "A Cut Generation Method for the (0, 1)-Knapsack Problem with a Variable Capacity," Journal of the Korean OR/MS Society, Vol.25, No.3(2000), pp.1-15.
- Nemhauser, G.L. and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, 1988.