An algorithm for 0-1 multiple-knapsack problems

DOI10.1002/NAV.3800250316MaRDI QIDQ4175050zbMATH OpenOpenAlexFDO

Authors 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

Branch-And-Bound AlgorithmMultiple Knapsack Problem

Mathematics Subject Classification ID

Boolean programming (90C09)

Cited in

(13)

• 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
• Mathematical models and decomposition methods for the multiple knapsack problem
• Iterated responsive threshold search for the quadratic multiple knapsack problem
• An ejection chain approach for the quadratic multiple knapsack problem
• Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation
• A heuristic routine for solving large loading problems
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• A branch-and-bound algorithm for hard multiple knapsack problems
• Semi-definite relaxation algorithm of multiple knapsack problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175050)