An exact algorithm for the budget-constrained multiple knapsack problem

DOI10.1080/00207160.2011.608844MaRDI QIDQ2885555zbMATH OpenOpenAlexFDO

Authors Byungjun You, Takeo Yamada

Publication date 23 May 2012

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2011.608844

zbMATH Keywords

branch-and-boundLagrangian relaxationmultiple knapsack problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• An exact algorithm for the fixed-charge multiple knapsack problem
• An exact algorithm for large multiple knapsack problems
• CORAL: an exact algorithm for the multidimensional knapsack problem
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
• Upper and lower bounding procedures for the multiple knapsack assignment problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1055067 (Why is no real title available?)
• An exact algorithm for large multiple knapsack problems
• An expanding-core algorithm for the exact 0-1 knapsack problem
• Computing Partitions with Applications to the Knapsack Problem
• Reduction Algorithm for Zero-One Single Knapsack Problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(13)

• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
• A multi-period renewal equipment problem
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem
• An exact algorithm for the fixed-charge multiple knapsack problem
• Budgeting with bounded multiple-choice constraints.
• A new upper bound for the multiple knapsack problem
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• A branch-and-bound algorithm for hard multiple knapsack problems
• Algorithmic Applications in Management
• An exact algorithm for large multiple knapsack problems
• scientific article; zbMATH DE number 438310 (Why is no real title available?)
• Two-agent advertisement scheduling on physical books to maximize the total profit
• Upper and lower bounding procedures for the multiple knapsack assignment problem

Describes a project that uses

Uses Software

• MULKNAP
• Knapsack

This page was built for publication: An exact algorithm for the budget-constrained multiple knapsack problem

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