An exact algorithm for the budget-constrained multiple knapsack problem

DOI10.1080/00207160.2011.608844zbMath1247.90200OpenAlexW2103428370MaRDI QIDQ2885555

Takeo Yamada, Byungjun You

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

Lagrangian relaxationbranch-and-boundmultiple knapsack problem

Mathematics Subject Classification ID

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

Related Items (2)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit

Uses Software

• Knapsack
• MULKNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for large multiple knapsack problems
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Reduction Algorithm for Zero-One Single Knapsack Problems
• Computing Partitions with Applications to the Knapsack Problem

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