An exact algorithm for the Knapsack problem with setup

DOI10.1504/IJOR.2009.025197zbMath1169.90485MaRDI QIDQ840596

Robert L. Bulfin, Yanchun Yang

Publication date: 13 September 2009

Published in: International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

upper boundbranch-and-boundKnapsack problemsetup

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (4)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ An exact approach for the 0-1 knapsack problem with setups ⋮ Exact approaches for the knapsack problem with setups ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup

This page was built for publication: An exact algorithm for the Knapsack problem with setup