Multistage knapsack (Q2119404): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Changing Bases: Multistage Optimization for Matroids and Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility Location in Evolving Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5116470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infrastructure Leasing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Sum-Radii Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tradeoff between Stability and Fit / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Recourse for Online MST and TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offline and online facility leasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified Algorithms for Online Learning and Competitive Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Analysis via Regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Facility Location via Exponential Clocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fully polynomial time approximation scheme for the Knapsack problem / 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: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank

Revision as of 11:28, 28 July 2024

scientific article
Language Label Description Also known as
English
Multistage knapsack
scientific article

    Statements

    Multistage knapsack (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2022
    0 references
    multistage optimization
    0 references
    knapsack
    0 references
    complexity
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references