An algorithm for 0-1 multiple-knapsack problems

DOI10.1002/NAV.3800250316zbMath0393.90061OpenAlexW1992527911MaRDI QIDQ4175050

Ming S. Hung, John C. Fisk

Publication date: 1978

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800250316

zbMATH Keywords

Multiple Knapsack ProblemBranch-And-Bound Algorithm

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (13)

A heuristic routine for solving large loading problems ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ An ejection chain approach for the quadratic multiple knapsack problem ⋮ An exact algorithm for large multiple knapsack problems ⋮ Solution of the zero-one multiple knapsack problem ⋮ Heuristic algorithms for the multiple knapsack problem ⋮ A bound and bound algorithm for the zero-one multiple knapsack problem ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation ⋮ Mathematical models and decomposition methods for the multiple knapsack problem ⋮ Semi-definite relaxation algorithm of multiple knapsack problem ⋮ A branch-and-bound algorithm for hard multiple knapsack problems ⋮ Iterated responsive threshold search for the quadratic multiple knapsack problem

This page was built for publication: An algorithm for 0-1 multiple-knapsack problems