The linking set problem: a polynomial special case of the multiple-choice knapsack problem
From MaRDI portal
Publication:844527
DOI10.1007/s10958-009-9612-yzbMath1192.90152OpenAlexW2092262142WikidataQ57736608 ScholiaQ57736608MaRDI QIDQ844527
Agostinho Agra, Cristina Requejo
Publication date: 19 January 2010
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-009-9612-y
Related Items
The linking set problem: a polynomial special case of the multiple-choice knapsack problem ⋮ Solving huge size instances of the optimal diversity management problem ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A decomposition approach for the \(p\)-median problem on disconnected graphs ⋮ A Dynamic Programming Approach for a Class of Robust Optimization Problems ⋮ Using decomposition to improve greedy solutions of the optimal diversity management problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The minimum weight \(t\)-composition of an integer
- A fast algorithm for the linear multiple-choice knapsack problem
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem
- A minimal algorithm for the multiple-choice knapsack problem
- Optimizing constrained subtrees of trees
- A pegging approach to the precedence-constrained knapsack problem
- A decomposition approach for a very large scale optimal diversity management problem
- Solution methods for thep-median problem: An annotated bibliography
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Fast Approximation Algorithms for Knapsack Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- A cost function property for plant location problems
- Comments on the note of Frieze
- The Optimal Diversity Management Problem
- Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
