KNAPSACK
Algorithms for Knapsack Problems


KNAPSACK is a FORTRAN77 library which contains implementations of algorithms for a variety of knapsack problems, by Silvano Martelo and Paolo Toth.

CodeProblemType
MT10-1 KnapsackExact
MT1R0-1 KnapsackExact (real data)
MT20-1 KnapsackExact/Approximate
MTB2Bounded KnapsackExact/Approximate
MTU2Unbounded KnapsackExact/Approximate
MTSLSubset SumExact/Approximate
MTC2Change MakingExact/Approximate
MTCBBounded Change MakingExact/Approximate
MTM0-1 Multiple KnapsackExact/Approximate
MTHM0-1 Multiple KnapsackApproximate
MTGGeneralized AssignmentExact/Approximate
MTHGGeneralized AssignmentApproximate
MTPBin PackingExact/Approximate

Languages:

KNAPSACK 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_01, a FORTRAN77 library which uses brute force to solve small versions of the 0/1 knapsack problem;

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.

TOMS632, a FORTRAN77 library which solves the multiple knapsack problem, by Silvano Martello and Paolo Toth. This is ACM TOMS algorithm 632.

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:

Examples and Tests:

List of Routines:

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


Last revised on 06 December 2009.