Packing a Knapsack of Unknown Capacity (Q5275439): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.2806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Knapsack Secretary Problem with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The online knapsack problem: advice and randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robustness by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable robust knapsacks: the discrete scenario case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sometimes Travelling is Easy: The Master Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing a Knapsack of Unknown Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Sequencing on an Unreliable Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-Oblivious Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization over Integers with Robustness in Cost and Few Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for online knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online removable knapsack problem under convex function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online removable knapsack with limited cuts / 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: Robust Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online knapsack with resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal approximations for TSP, Steiner tree, and set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Knapsack Solutions with Cardinality Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic and Stochastic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic and Stochastic Knapsack Problem with Random Sized Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized strategies for cardinality robustness in the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic on-line knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust randomized matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hiding information and signatures in trapdoor knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Robust Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey on Oblivious Routing Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Horizon Stochastic Knapsacks with Applications to Yield Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: The online knapsack problem with incremental capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications / rank
 
Normal rank

Latest revision as of 03:44, 14 July 2024

scientific article; zbMATH DE number 6745029
Language Label Description Also known as
English
Packing a Knapsack of Unknown Capacity
scientific article; zbMATH DE number 6745029

    Statements

    Packing a Knapsack of Unknown Capacity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    knapsack
    0 references
    unknown capacity
    0 references
    robustness
    0 references
    approximation guarantees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references