Max-Min Optimization of the Multiple Knapsack Problem: an Implicit Enumeration Approach
The binary knapsack problem is fundamental in combinatorial optimization, and algorithms to solve problems with nearly a million items are now available through the Internet. This paper is concerned with a variation of the problem, where there are n items to be packed into m knapsacks. Our problem is to find the assignment of items into knapsacks such that the minimum of the knapsack profits is maximized. This problem is referred to as the max-min multiple knapsack problem (M 3 KP). First, some upper bounds and a heuristic algorithm are presented, and based on these, we explore algorithms to solve the problem to optimally. Then, we make use of a novel pruning method to develop an implicit enumeration algorithm that can solve M 3 KPs with up to a few hundred items exactly.
KeywordsMultiple knapsack problem max-min optimization implicit enumeration
Unable to display preview. Download preview PDF.
- Aarts, E. and Lenstra, J. K. ed. Local Search in Combinatorial Optimization. Chichester:John Wiley & Sons, 1997.Google Scholar
- Dash Optimization Inc. XPRESS-MP Release 11. 2000.Google Scholar
- Fourer. R., Software survey: linear programming. OR/MS Today 1999, 26:64–71.Google Scholar
- Garey, M. R. and Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York:Freeman and Company, 1979.Google Scholar
- Gill, P. E., Murray, W., Wright, M. H. Practical Optimization. New York:Academic Press, 1981.Google Scholar
- Martello, S. and Toth, P. Knapsack Problems: Algorithms and Computer Implementations. Chichester:John Wiley & Sons, 1990.Google Scholar
- Sedgewick, R. Algorithms in C, 3rd Edition. Reading:Addison-Wesley, 1998.Google Scholar
- Wolsey, L. A. Integer Programming. Chichester:John Wiley & Sons, 1998.Google Scholar