This file contains a collection of 48 0/1 Multiple Knapsack
Problems, that are well known from the literature, and
and are solved in the following publications:
Tabu Search: F. Dammeyer and S. Voss (1991) "Dynamic tabu list
management using the reverse elimination method." Annals of
Operations Research.
Simulated Annealing: A. Drexel (1988) "A Simulated Annealing
Approach to the Multiconstraint Zero-One Knapsack Problem."
Computing, 40:1-8.
Genetic Algorithms: S. Khuri, T. Baeck, J. Heitkoetter,
(1994) "The Zero/One Multiple Knapsack Problem and
Genetic Algorithms", pp188-193, Proceedings of the 1994
ACM Symposium on Applied Computing, SAC'94, Phoenix, Arizona.
The Khuri et al paper is available by ftp from alife.santafe.edu
directory: /pub/USER-AREA/EC/GA/papers
file: sac94.ps.gz
or by ftp from lumpi.informatik.uni-dortmund.de
directory: /pub/GA/papers
file: sac94.ps.gz
These problems were contributed to OR-Library by
Joerg Heitkoetter (jh@germany.eu.net).
+++++++++++++++++++++++++++++
LITERATURE
S. Senyu and Y. Toyada (1967) "An approach to linear programming
with 0-1 variables."
Management Science, 15:B196-B207. [SENTO*.DAT]
H.M. Weingartner and D.N. Ness (1967) "Methods for the solution of
the multi-dimensional 0/1 knapsack problem."
Operations Research, 15:83-103. [WEING*.DAT]
W. Shi (1979) "A branch and bound method for the multiconstraint
zero one knapsack problem."
J. Opl. Res. Soc., 30:369-378. [WEISH*.DAT]
A. Freville and G. Plateau (1990) "Hard 0-1 multiknapsack test problems
for size reduction methods."
Investigation Operativa, 1:251-270. [PB*.DAT, HP*.DAT]
+++++++++++++++++++++++++++++
FILE FORMAT
The test data's file format, using 10 columns, whenever possible, is
as follows:
<n := #knapsacks> <m := #objects>
<m weights of objects>
<n knapsack capacities>
<A := mxn matrix of constraints>
<known optimum>
