Exact approaches for the knapsack problem with setups (Q1652523): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57659004, #quickstatements; #temporary_batch_1706974296281
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2755233613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate and exact algorithms for the fixed-charge knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic solution approaches for the mixed integer setup knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms For The Setup Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for the knapsack problem with setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the 0-1 knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving branch-and-cut performance by random sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving makespan minimization problems with Lagrangean decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the knapsack problem with special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming revisited: Improving knapsack algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming and approximation results for the knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the Knapsack problem with setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank

Revision as of 02:15, 16 July 2024

scientific article
Language Label Description Also known as
English
Exact approaches for the knapsack problem with setups
scientific article

    Statements

    Exact approaches for the knapsack problem with setups (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    knapsack problems
    0 references
    column generation
    0 references
    relaxations
    0 references
    branch-and-bound algorithms
    0 references
    computational experiments
    0 references
    0 references
    0 references

    Identifiers