An exact algorithm for the Knapsack problem with setup

DOI10.1504/IJOR.2009.025197MaRDI QIDQ840596zbMATH OpenFDO

Authors Yanchun Yang, Robert L. Bulfin

Publication date 13 September 2009

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

zbMATH Keywords

upper boundbranch-and-boundsetupKnapsack problem

Mathematics Subject Classification ID

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

Recommendations

• An exact approach for the 0-1 knapsack problem with setups
• Exact Algorithms For The Setup Knapsack Problem
• A dynamic programming algorithm for the knapsack problem with setup
• Exact approaches for the knapsack problem with setups
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Cited in

(11)

• A new exact algorithm for concave knapsack problems with integer variables
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem
• A dynamic programming algorithm for the knapsack problem with setup
• Exact Algorithms For The Setup Knapsack Problem
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
• Exact algorithm for solving knapsack problem with a single continuous variable
• Exact algorithm for concave knapsack problems: linear underestimation and partition method
• Exact approaches for the knapsack problem with setups
• An exact approach for the 0-1 knapsack problem with setups
• A faster exact method for large-scale knapsack problems with setup costs and times
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems

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

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