LP relaxation of the two dimensional knapsack problem with box and GUB constraints

European Journal of Operational Research

Volumn 89, Issue 3, 1996, Pages 609-617

  Bagchi, Ansuman ^a   Bhattacharyya, Nalinaksha ^b   Chakravarti, Nilotpal ^b  

^a United States   (United States)

^b INDIAN INSTITUTE OF MANAGEMENT CALCUTTA   (India)

Author keywords

Knapsack problem; Manufacturing industries; Parametric Linear Programming

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MANUFACTURE; ROLLING MILLS; SET THEORY;

GENERALIZED UPPER BOUND; KNAPSACK PROBLEM; MANUFACTURING INDUSTRIES; PARAMETRIC LINEAR PROGRAMMING;

LINEAR PROGRAMMING;

EID: 0030110028     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00285-1     Document Type: Article

References (10)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. Best, M.J., and Ritter, K., Linear Programming; Active Set Analysis and Computer Programs, Prentice-Hall, Englewood Cliffs, NY, 1985.
3. Dyer, M.E., "An O(n) algorithm for the multiple-choice knapsack linear program", Mathematical Programming 29 (1984) 57-63.
4. Glover, F., and Klingman, D., "A O(n log n) algorithm for LP knapsacks with GUB constraints", Mathematical Programming 17 (1979) 345-361.
5. Ibaraki, T., Hasegawa, T., Teranaka, K., and Iwase, J., "The multiple choice knapsack problem", Journal of the Operations Research Society of Japan 21 (1978) 59-95.
6. Ibaraki, T., and Katoh, N., Resource Allocation Problems: Algorithmic Approaches, MIT Press, Cambridge, MA, 1988.
7. Murty, K.G., Linear Programming, Wiley, New York, 1983.
8. Schrijver, A., Theory of Linear Programming and Integer Programming, Wiley, New York, 1986.
9. Sinha, P., and Zoltners, A., "The multiple choice knapsack problem", Operations Research 27 (1979) 503-515.
10. Zemel, E., "The linear multiple choice knapsack problem", Operations Research 28 (1980) 1312-1423.