Exact approaches for the knapsack problem with setups
From MaRDI portal
Publication:1652523
DOI10.1016/j.cor.2017.09.019zbMath1391.90516OpenAlexW2755233613WikidataQ57659004 ScholiaQ57659004MaRDI QIDQ1652523
Fabio Furini, Emiliano Traversi, Michele Monaci
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/18642
Related Items
Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation, A threshold search based memetic algorithm for the disjunctively constrained knapsack problem, 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, On approximating the incremental knapsack problem, Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items, LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup, An exact approach for the bilevel knapsack problem with interdiction constraints and extensions, A decomposition approach for multidimensional knapsacks with family‐split penalties, Approximating the 3-period incremental knapsack problem, The multiple multidimensional knapsack with family-split penalties, A branch-and-price algorithm for the temporal bin packing problem, On the exact separation of cover inequalities of maximum-depth
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Improving branch-and-cut performance by random sampling
- A dynamic programming algorithm for the knapsack problem with setup
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An exact algorithm for the Knapsack problem with setup
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
- Knapsack problems with setups
- A note on the knapsack problem with special ordered sets
- Solving makespan minimization problems with Lagrangean decomposition
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- An exact approach for the 0-1 knapsack problem with setups
- Dynamic programming revisited: Improving knapsack algorithms
- Approximate and exact algorithms for the fixed-charge knapsack problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- An O(n) algorithm for the multiple-choice knapsack linear program
- An Algorithm for Large Zero-One Knapsack Problems
- Computing Partitions with Applications to the Knapsack Problem
- Exact Algorithms For The Setup Knapsack Problem
- Improved dynamic programming and approximation results for the knapsack problem with setups
- Selected Topics in Column Generation
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
