References
- 대한산업공학회지 v.21 no.4 일반 다중선택 선형배낭문제의 신속한 해법연구 원중연
- J. Compt. & System Sci. v.1 Generalized Upper Bounding Techniques Dantzig, G. B.;R. M. Vanslyke
- Math. Progr. v.29 An O(n) Algorithm for the Multiple-Choice Knapsack Linear Problem. Dyer, M. E.
- Math. Progr. v.17 A O(nlogn) Algorithm for LP Knapsacks with GUB Constraints Glover, F.;D. Klingman
- Opns. Res. Letters v.1 A Note on the Knapsack Problem with Special Ordered Sets Johnson, E. L.;M. W. Padberg
- Opns. Res. v.33 Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models Johnson, E. L.;M. M. Kostreva;U. H. Suhl
- Algorithms: Their Complexity and Efficiency Kronsjo, L. I.
- European J. Opnl. Res. v.83 A Minimal Algorithm for the Multiple-Choice Knapsack Problem Pisinger, D.
- Math. Progr. Study v.4 Implicit Representation of Variable Upper Bounds in Linear Programming Schrage, L.
- Math. Progr. v.14 Implicit Representation of Generalized Variable Upper Bounds in Linear Programming Schrage, L.
- Mangt. Sci. v.29 Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems Stecke, K. E.
- Inform. Proc. Letters v.18 An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems Zemel, E.