Knapsack problems with setups

DOI10.1016/j.ejor.2008.05.001zbMath1176.90175OpenAlexW2060438679MaRDI QIDQ1041933

J. Blot

Publication date: 7 December 2009

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

Full work available at URL: https://hal.inria.fr/inria-00232782/file/fcknpWorkingPaperRevision2.pdf

zbMATH Keywords

branch-and-boundknapsack problemsetupfixed costvariable upper bound

Mathematics Subject Classification ID

Production models (90B30)

Related Items (17)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A cross entropy algorithm for the Knapsack problem with setups ⋮ Generalized quadratic multiple knapsack problem and two solution approaches ⋮ An exact approach for the 0-1 knapsack problem with setups ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Exact approaches for the knapsack problem with setups ⋮ A dynamic programming algorithm for the knapsack problem with setup ⋮ Optimized load planning for motorail transportation ⋮ The replenishment problem with multiple articles and an order threshold ⋮ Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups ⋮ An approximation scheme for a bilevel knapsack problem ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ New lower bounds for bin packing problems with conflicts ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ Decomposition methods for the lot-sizing and cutting-stock problems in paper industries ⋮ Knapsack problems with setups

Uses Software

• Knapsack
• XPRESS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Knapsack problems with setups
• A note on the knapsack problem with special ordered sets
• A minimal algorithm for the multiple-choice knapsack problem
• Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• An Algorithm for Large Zero-One Knapsack Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Exact Algorithms For The Setup Knapsack Problem
• Discrete-Variable Extremum Problems
• Implementing Mixed Integer Column Generation

This page was built for publication: Knapsack problems with setups