참고문헌
- Balas, E., 'Facet s of Knapsack Polytope,' Mathematical Programming 8 (1979), 146-164 https://doi.org/10.1007/BF01580440
- Balas, E. and E. Zemel, 'Facets of the Knapsack Polytope from Minimal Covers,' SIAM Journal on Applied Mathematics 34 (1978), 119-148 https://doi.org/10.1137/0134010
- Brockmuller, B., O. Gunluk and L. A. Wolsey, 'Designing Private Line Network - Polyhedral Analysis and Computation,' CORE Discussion paper 9647, 1996
- Ceria, S., C. Cordier, H. Marchand and L. A. Wolsey, 'Cutting Planes for Integer Programs with Genaral Integer Variables,' Mathematical Programming 81 (1998), 201-214 https://doi.org/10.1007/BF01581105
- Gomory, R. E., 'Outline of an algorithm for integer solutions to linear programs,' Bulletin of American Mathematical Society 64 (1958), 275-278 https://doi.org/10.1090/S0002-9904-1958-10224-4
- Gomory, R. E., 'Solving linear programming problems in integers,' in Combinatorial Analysis, R.E. Bellman and M. Hall, Jr., eds., American Mathematical Society, 1960, 211-216
- Gomory, R. E., 'An Algorithm for Integer Solutions to Linear Programs,' in Recent Advances in Mathematical Programming (1963), 269-302
- Gong, R. E., 'Capacitated Network Design with Column Generation,' Ph.D Thesis, Georgia Institute of Technology, Atlanta, GA, USA, 1995
- Lee, K., 'Routing and Capacity Assignment Models and Algorithms for the Design of Telecommunication Networks,' Ph.D Thesis, Korea Advanced Institute of Science and Technology, Taejon, Korea, 1998
- Lee , K. and S. Park, 'A Cut Generation Method for the (0,1)-Knapsack Problem with a Variable Capacity (Text in Korean),' Journal of the Korean Operations Research and Management Science Society 25 (2000), 1-15
- Nemhauser, G. L. and L. A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988