toms632


toms632, a FORTRAN77 code which solves the 0-1 multiple knapsack problem. This is a version of ACM TOMS algorithm 632, by Silvano Martello, Paolo Toth.

Licensing:

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

Languages:

toms632 is available in a FORTRAN77 version.

Related Data and Programs:

toms632_test

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:

Original Fortran77 version by 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:


Last revised on 29 November 2023.