A branch and bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints

Computers and Operations Research

Volumn 31, Issue 5, 2004, Pages 695-711

  Kozanidis, George ^a   Melachrinoudis, Emanuel ^a  

^a Northeastern University   (United States)

Author keywords

Branch and bound algorithm; Mixed integer knapsack problem; Multiple choice constraints

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; CONSTRAINT THEORY; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; RESOURCE ALLOCATION; TRANSPORTATION;

OPTIMAL RESOURCE ALLOCATION; TRANSPORTATION MANAGEMENT;

OPERATIONS RESEARCH;

ALGORITHM;

EID: 0942269530     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00021-2     Document Type: Article

References (18)

1. Lin EY-H. A bibliographical survey on some well known non-standard knapsack problems. INFOR 1998;36:274-317.
2. Johnson EL, Padberg MW. A note on the knapsack problem with special ordered sets. Operations Research Letters 1981;1:18-22.
3. Glover F, Klingman D. An O(n log n) algorithm for LP knapsacks with GUB constraints. Mathematical Programming 1979;17:345-61.
4. Witzgall C. On one-row linear programs. In: Fiacco AV, Kortane KO editors. Ext. methods and systems analysis. Berlin: Springer, 1980. p. 384-414.
5. Dyer ME. An O(n) algorithm for the multiple-choice knapsack linear program. Mathematical Programming 1984;29:57-63.
6. Dudzinski K, Walukiewicz S. A fast algorithm for the linear multiple-choice knapsack problem. Operations Research Letters 1984;3:205-9.
7. Zemel E. An O(n) algorithm for the linear multiple choice knapsack problem and related problems. Information Processing Letters 1984;18:123-8.
8. Gass SI, Shao Jr SP. On the solution of special generalized upper-bounded problems: the LP/GUB knapsack problem and the λ-form separable convex objective function problem. Mathematical Programming Study 1985;24:104-15.
9. Sarin S, Karwan MH. The linear multiple choice knapsack problem. Operations Research Letters 1989;8:95-100.
10. Zemel E. The linear multiple choice knapsack problem. Operations Research 1980;28:1412-23.
11. Chandra AK, Hirschberg DS, Wong CK. Approximate algorithms for some generalized knapsack problems. Theoretical Computer Science 1976;3:293-304.
12. Sinha P, Zoltners AA. The multiple choice knapsack problem. Operations Research 1979;27:503-15.
13. Armstrong RD, Kung DS, Sinha P, Zoltners AA. A computational study of a multiple-choice knapsack algorithm. ACM Transactions on Mathematical Software 1983;9:184-98.
14. Pisinger D. A minimal algorithm for the multiple choice knapsack problem. European Journal of Operational Research 1995;83:394-410.
15. Dantzig GB. Linear programming and extensions. Princeton, NJ: Princeton University Press, 1963.
16. Graham RL. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters 1972;1:132-3.
17. Cormen TH, Leiserson CE, Rivest RL. Introduction to algorithms. Cambridge, MA: The MIT Press, 2001.
18. LINGO. User's guide. Chicago, IL: LINDO Systems, Inc., http://www.lindo.com/, 2001.