A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints

References

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