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

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

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

Cited In (6)

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

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)