TOMS632
The 0-1 Multiple Knapsack Problem

TOMS632 is a FORTRAN77 library which solves the 0-1 multiple knapsack problem.

Licensing:

The computer code and data files made available on this web page are distributed under the GNU LGPL license.

Languages:

TOMS632 is available in a FORTRAN77 version.

Related Data and Programs:

BIN_PACKING, a dataset directory which contains examples of the bin packing problem, in which a number of objects are to be packed in the minimum possible number of uniform bins;

CHANGE_MAKING, a dataset directory which contains test data for the change making problem;

COMBO, a FORTRAN90 library which includes many combinatorial routines.

GENERALIZED_ASSIGNMENT, a dataset directory which contains test data for the generalized assignment problem;

KNAPSACK, a FORTRAN77 library which solves a variety of knapsack problems, by Silvano Martelo and Paolo Toth.

KNAPSACK_01, a dataset directory which contains test data for the 0/1 knapsack problem;

KNAPSACK_MULTIPLE, a dataset directory which contains test data for the multiple knapsack problem;

LAMP, a FORTRAN77 library which solves linear assignment and matching problems.

LAU_NP, a FORTRAN90 library which implements heuristic algorithms for various NP-hard combinatorial problems.

PARTITION_PROBLEM, a FORTRAN77 library which seeks solutions of the partition problem, splitting a set of integers into two subsets with equal sum.

SUBSET, a FORTRAN77 library which enumerates combinations, partitions, subsets, index sets, and other combinatorial objects.

SUBSET_SUM, a FORTRAN77 library which seeks solutions of the subset sum problem.

SUBSET_SUM, a dataset directory which contains examples of the subset sum problem, in which a set of numbers is given, and is desired to find at least one subset that sums to a given target value.

Author:

Silvano Martello, Paolo Toth.

Reference:

1. Silvano Martello, Paolo Toth,
   MKP: 0-1 multiple knapsack problem,
   ACM Transactions on Mathematical Software,
   Volume 11, Number 2, June 1985, pages 135-140.
2. Silvano Martello, Paolo Toth,
   Knapsack Problems: Algorithms and Computer Implementations,
   Wiley, 1990,
   ISBN: 0-471-92420-2,
   LC: QA267.7.M37.

Source Code:

• toms632.f, the source code.
• toms632.sh, BASH commands to compile the source code.

Examples and Tests:

• toms632_prb.f, a sample calling program.
• toms632_prb.sh, BASH commands to compile and run the sample program.
• toms632_prb_input.txt, the input file.
• toms632_prb_output.txt, the output file.

List of Routines:

• MKP solves a 0-1 multiple knapsack problem.
• SIGMA computes an upper bound on the best final solution.
• PI computes a feasible solution to the problem.
• PAR carries out parametric computation of the upper bounds.
• SKP solves the 0-1 single knapsack problem.
• TIMESTAMP prints out the current YMDHMS date as a timestamp.

You can go up one level to the FORTRAN77 source codes.