A column-generation approach to the multiple knapsack problem with color constraints

INFORMS Journal on Computing

Volumn 18, Issue 1, 2006, Pages 129-134

  Forrest, John J H ^a   Kalagnanam, Jayant ^a   Ladanyi, Laszlo ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Column generation; Integer programming; Inventory production applications; Multiple knapsack problem

Indexed keywords

EID: 33645557500     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0078     Document Type: Article

References (8)

1. Bixby, R. E. 2004. http://www.caam.rice.edu/~bixby/miplib/miplib3.html.
2. Chvátal, V. 1983. Linear Programming. W. H. Freeman and Company, New York.
3. Dantzig, G., P. Wolfe. 1960. Decomposition principle for linear programs. Oper. Res. 8 101-111.
4. IBM. 2004. http://www-124.ibm.com/developerworks/opensource/cvs/coin/ COIN/Mps/Big/?logsort=cvs#dirlist.
5. Kalagnanam, J., M. Dawande, M. Trumbo, H. S. Lee. 2000. The surplus inventory matching problem in the process industry. Oper. Res. 48 505-516.
6. Lasdon, L. 1970. Optimization Theory for Large Systems. Macmillan, New York.
7. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley & Sons, New York.
8. Savelsbergh, M. W. P. 1997. A branch and price algorithm for the generalized assignment problem. Oper. Res. 45 831-841.