The linking set problem: a polynomial special case of the multiple-choice knapsack problem

DOI10.1007/S10958-009-9612-YzbMATH Open1192.90152OpenAlexW2092262142WikidataQ57736608 ScholiaQ57736608MaRDI QIDQ844527FDOQ844527

Authors 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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The knapsack problem with disjoint multiple-choice constraints
• A fast algorithm for the linear multiple-choice knapsack problem
• scientific article; zbMATH DE number 3906236
• scientific article; zbMATH DE number 3889280
• The multiple-choice multi-period knapsack problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3635849 (Why is no real title available?)
• A cost function property for plant location problems
• A decomposition approach for a very large scale optimal diversity management problem
• A fast algorithm for the linear multiple-choice knapsack problem
• A minimal algorithm for the multiple-choice knapsack problem
• A pegging approach to the precedence-constrained knapsack problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Comments on the note of Frieze
• Fast Approximation Algorithms for Knapsack Problems
• Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
• Optimizing constrained subtrees of trees
• Solution methods for thep-median problem: An annotated bibliography
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
• The Optimal Diversity Management Problem
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem
• The minimum weight \(t\)-composition of an integer

Cited in

(6)

• A decomposition approach for the \(p\)-median problem on disconnected graphs
• A dynamic programming approach for a class of robust optimization problems
• Solving huge size instances of the optimal diversity management problem
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem
• Using decomposition to improve greedy solutions of the optimal diversity management problem
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: The linking set problem: a polynomial special case of the multiple-choice knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844527)