Knapsack problems with setups
From MaRDI portal
Recommendations
- Exact approaches for the knapsack problem with setups
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
- Exact Algorithms For The Setup Knapsack Problem
- Algorithms for the bounded set-up knapsack problem
- A dynamic programming algorithm for the knapsack problem with setup
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A minimal algorithm for the multiple-choice knapsack problem
- A note on the knapsack problem with special ordered sets
- An Algorithm for Large Zero-One Knapsack Problems
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Discrete-variable extremum problems
- Exact Algorithms For The Setup Knapsack Problem
- Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
- Implementing Mixed Integer Column Generation
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Knapsack problems with setups
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
Cited in
(29)- The replenishment problem with multiple articles and an order threshold
- Algorithms for the bounded set-up knapsack problem
- New lower bounds for bin packing problems with conflicts
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
- A dynamic programming algorithm for the knapsack problem with setup
- Optimized load planning for motorail transportation
- Exact Algorithms For The Setup Knapsack Problem
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- A cross entropy algorithm for the Knapsack problem with setups
- A Knapsack Secretary Problem with Applications
- The multiple multidimensional knapsack with family-split penalties
- Integer knapsack problems with set-up weights
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Exact approaches for the knapsack problem with setups
- Improved dynamic programming and approximation results for the knapsack problem with setups
- An exact approach for the 0-1 knapsack problem with setups
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups
- The knapsack problem with forfeits
- Knapsack problems with setups
- Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
- A faster exact method for large-scale knapsack problems with setup costs and times
- A decomposition approach for multidimensional knapsacks with family‐split penalties
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- Technical Note—Some Very Easy Knapsack/Partition Problems
- Where are the hard knapsack problems?
- Generalized quadratic multiple knapsack problem and two solution approaches
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
- An approximation scheme for a bilevel knapsack problem
This page was built for publication: Knapsack problems with setups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041933)
