한국경영과학회지 (Journal of the Korean Operations Research and Management Science Society)

  • 제22권3호
  • /
  • Pages.1-9
  • /
  • 1997
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

단순상한 및 확장된 일반상한제약을 갖는 선형배낭문제의 O($n^2log n$) 해법

An O($n^2log n$) Algorithm for the Linear Knapsack Problem with SUB and Extended GUB Constraints

  • 발행 : 1997.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

키워드

참고문헌

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