On approximating the incremental knapsack problem (Q2422736): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q128316774, #quickstatements; #temporary_batch_1726420686562
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Beating ratio 0.5 for weighted oblivious matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for knapsack problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ILP-based Proof System for the Crossing Number Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the 3-period incremental knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for the incremental knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New exact approaches and approximation results for the penalized knapsack problem / 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: A new exact approach for the 0-1 collapsing knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—The Multiperiod Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the time-invariant incremental knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches for the knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for the parametric knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Model for Combinatorial Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming in connection with an FPTAS for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / 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: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The online knapsack problem with incremental capacity / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128316774 / rank
 
Normal rank

Latest revision as of 18:18, 15 September 2024

scientific article
Language Label Description Also known as
English
On approximating the incremental knapsack problem
scientific article

    Statements

    On approximating the incremental knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2019
    0 references
    incremental knapsack problem
    0 references
    approximation scheme
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references

    Identifiers