An Efficient Algorithm for an Extension of the Generalized Lienar Multiple Choice Knapsack Problem

일반 다중선택 선형배낭문제의 확장문제에 대한 효율적인 해법

  • 원중영 (경기대학교 산업공학과) ;
  • 전싱진 (서울대학교 산업공학과)
  • Published : 1992.04.01

Abstract

An extension of generalized linear multiple choice knapsack problem [1] is presented and an algorithm of order 0([n .n$_{max}$]$_{2}$) is developed by exploiting its extended properties, where n and n$_{max}$ denote the total number of variables and the cardinality of the largest multiple choice set, respectively. A numerical example is presented and computational aspects are discussed.sed.

Keywords

References

  1. 韓國經營科學會誌 v.15 no.2 一般 多重選擇 線型背囊問題에 대한 效率的인 解法 元重淵;鄭聖進
  2. J. ACM. v.9 A Computational Study of a Multiple-Choice Knapsack Problem Armstrong,R.D.;Kung,D.S.;Sinha,P.;Zoltners,A.A.
  3. Management Sci. v.28 The Multiple Choice Nested Knapsack Model Armstrong,R.D.;Sinha,P.;Zoltners,A.A.
  4. Opns. Res. v.28 An Algorithm for Large Zero-One Knapsack problems Balas,E.;Zemel,E.
  5. Opns. Res. Letters v.3 no.00 A Fast Algorithm for the Linear Multiple-Choice Knapsack Problem Dudzinski,K.;Walukiewicz,S.
  6. Math. Progr. v.29 An O(n) Algorithm for the Multiple-Choice Knapsack Linear Problem Dyer,M.E.
  7. Math. Progr. v.17 A O(nlogn) Algorithm for LP Knapsacks with GUB Constraints Glover,F.;Klingman,D.
  8. Opns. Res. Letters v.1 A Note on the Knapsack Problem with Special Ordered Sets Johnson,E.L.;M.W.Padberg
  9. Opns. Res. v.27 The Multiple Choice Knapsack Problem Sinha,P.;A.A.Zoltners
  10. Management Sci. v.29 Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems Stecke,K.E.
  11. Opns. Res. v.28 The Linear Multiple Choice Knapsack Problem Zemel,E.
  12. Inform. Process. Lett. v.18 An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems Zemel,E.