A bound and bound algorithm for the zero-one multiple knapsack problem

DOI10.1016/0166-218X(81)90005-6zbMath0466.90050MaRDI QIDQ1155514

Paolo Toth, Silvano Martello

Publication date: 1981

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

integer linear programmingcomputational resultszero-one multiple knapsack problembound and bound algorithmtree- search technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09)

Related Items (16)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ An exact algorithm for large multiple knapsack problems ⋮ A new upper bound for the multiple knapsack problem ⋮ Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights ⋮ Heuristic algorithms for the multiple knapsack problem ⋮ Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver ⋮ An application of the multiple knapsack problem: the self-sufficient marine ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ An exact penalty function approach for nonlinear integer programming problems ⋮ Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ A novel discrete differential evolution algorithm combining transfer function with modulo operation for solving the multiple knapsack problem ⋮ A successive approximation algorithm for the multiple knapsack problem

Uses Software

• Algorithm 37

Cites Work

• Solution of the zero-one multiple knapsack problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• An Algorithm for the Solution of 0-1 Loading Problems
• An algorithm for 0-1 multiple-knapsack problems

This page was built for publication: A bound and bound algorithm for the zero-one multiple knapsack problem