Integer knapsack problems with set-up weights
From MaRDI portal
Publication:2642635
DOI10.1007/S10589-007-9020-5zbMath1161.90471OpenAlexW2069473047MaRDI QIDQ2642635
Laura A. McLay, Jacobson, Sheldon H.
Publication date: 17 August 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9020-5
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Integer knapsack problems with set-up weights ⋮ A dynamic programming algorithm for the knapsack problem with setup ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ Algorithms for the bounded set-up knapsack problem ⋮ Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights ⋮ The multiple multidimensional knapsack with family-split penalties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lifting cover inequalities for the precedence-constrained knapsack problem
- A fast algorithm for strongly correlated knapsack problems
- Simple but efficient approaches for the collapsing knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Integer knapsack problems with set-up weights
- Fast Approximation Algorithms for Knapsack Problems
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- Approximation Algorithms for Certain Scheduling Problems
- Exact Algorithms For The Setup Knapsack Problem
- Survey of scheduling research involving setup times
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- A multilevel passenger screening problem for aviation security
This page was built for publication: Integer knapsack problems with set-up weights
