Online removable knapsack problem under convex function (Q2453163): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082721953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Knapsack Problems 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: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / 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: 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

Latest revision as of 13:53, 8 July 2024

scientific article
Language Label Description Also known as
English
Online removable knapsack problem under convex function
scientific article

    Statements

    Online removable knapsack problem under convex function (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 June 2014
    0 references
    knapsack problems
    0 references
    online algorithms
    0 references
    competitive ratio
    0 references

    Identifiers