The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10958-009-9612-y / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10958-009-9612-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092262142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linking set problem: a polynomial special case of the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing constrained subtrees of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition approach for a very large scale optimal diversity management problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on the note of Frieze / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Diversity Management Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum weight \(t\)-composition of an integer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the linear multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cost function property for plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Branch-and-Bound Algorithm for Seeking the <i>P</i>-Median / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methods for thep-median problem: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pegging approach to the precedence-constrained knapsack problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10958-009-9612-Y / rank
 
Normal rank

Latest revision as of 05:00, 10 December 2024

scientific article
Language Label Description Also known as
English
The linking set problem: a polynomial special case of the multiple-choice knapsack problem
scientific article

    Statements

    The linking set problem: a polynomial special case of the multiple-choice knapsack problem (English)
    0 references
    19 January 2010
    0 references
    0 references
    0 references

    Identifiers