참고문헌
- 정광헌, "Branch-and-Cut 알고리즘에서 LotSizing 문제에 대한 Cutting Planes의 전산 성능 연구", 한국경영과학회지, 제40권, 제3호 (2015), pp.23-38. https://doi.org/10.7737/JKORMS.2015.40.3.023
- Belotti, P., J. Lee, L. Liberti, F. Margot, and A. Wachter, "Branching and Bounds Tightening Techniques for Non-Convex MINLP," Optimization Methods and Software, Vol.24, No.4-5(2009), pp.597-634. https://doi.org/10.1080/10556780903087124
- Chung, K., J.P.P. Richard, and M. Tawarmalani, "Lifted Inequalities for 0-1 Mixed-Integer Bilinear Covering Sets," Mathematical Programming, Vol.145, No.1-2(2014), pp.403-450. https://doi.org/10.1007/s10107-013-0652-1
- Chung, K., Strong valid inequalities for mixedinteger nonlinear programs via disjunctive programming and lifting, Ph. D thesis, University of Florida, Gainesville, FL, (2010).
- Falk, J.E. and R.M. Soland, "An Algorithm for Separable Nonconvex Programming Problems," Management Science, Vol.15, No.9 (1969), pp.550-569. https://doi.org/10.1287/mnsc.15.9.550
- Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh, "Sequence Independent Lifting in Mixed-Integer Programming," Journal of Combinatorial Optimization, Vol.4, No.1(2000), pp.109- 129. https://doi.org/10.1023/A:1009841107478
- McCormick, G.P., "Computability of Global Solutions to Factorable Nonconvex Programs : Part I-Convex Underestimating Problems," Mathematical Programming, Vol.10, No.1(1976), pp.147-175. https://doi.org/10.1007/BF01580665
- Nemhauser, G.L. and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley Interscience, New York, (1988).
- Richard, J.P.P. and M. Tawarmalani, "Lifting Inequalities : A Framework for Generating Strong Cuts for Nonlinear Programs," Mathematical Programming, Vol.121, No.1(2010), pp.61-104. https://doi.org/10.1007/s10107-008-0226-9
- Tawarmalani, M., J.P.P. Richard, and K. Chung, "Strong Valid Inequalities for Orthogonal Disjunctions and Bilinear Covering Sets," Mathematical Programming, Vol.124, No.1-2 (2010), pp.481-512. https://doi.org/10.1007/s10107-010-0374-6
- Wolsey, L.A., "Facets and Strong Valid Inequalities for Integer Programs," Operations Research, Vol.24, No.2(1976), pp.362-372.
- Wolsey, L.A., "Valid Inequalities and Superadditivity for 0-1 Integer Programs," Mathematics of Operations Research, Vol.2, No.1 (1977), pp.66-77. https://doi.org/10.1287/moor.2.1.66