Online knapsack problem under concave functions (Q2319907): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.03.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2617159737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online knapsack revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing a Knapsack of Unknown Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online unweighted knapsack problem with removal cost / 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: Online minimization knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-State Online Algorithms and Their Automated Competitive Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Resource Augmentations for Online Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportional Cost Buyback Problem with Weight Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic on-line knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online knapsack of unknown capacity. How to optimize energy consumption in smartphones / rank
 
Normal rank
Property / cites work
 
Property / cites work: The online knapsack problem with incremental capacity / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:28, 20 July 2024

scientific article
Language Label Description Also known as
English
Online knapsack problem under concave functions
scientific article

    Statements

    Online knapsack problem under concave functions (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2019
    0 references
    0 references
    online algorithms
    0 references
    knapsack problems
    0 references
    competitive ratio
    0 references
    0 references