scientific article; zbMATH DE number 2086630
From MaRDI portal
Publication:4737165
zbMath1056.68588MaRDI QIDQ4737165
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800293.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Game theory (91A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (37)
Packing a Knapsack of Unknown Capacity ⋮ The online knapsack problem with incremental capacity ⋮ Online maximum matching with recourse ⋮ A Theory of Auto-Scaling for Resource Reservation in Cloud Services ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Lower bounds on the performance of online algorithms for relaxed packing problems ⋮ Online knapsack of unknown capacity. How to optimize energy consumption in smartphones ⋮ Online knapsack with resource augmentation ⋮ 2D knapsack: packing squares ⋮ Online removable knapsack with limited cuts ⋮ Online minimization knapsack problem ⋮ Proportional cost buyback problem with weight bounds ⋮ Online knapsack with removal and recourse ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ The online knapsack problem: advice and randomization ⋮ Online removable square packing ⋮ Online removable knapsack problem under convex function ⋮ Randomized algorithms for online knapsack problems ⋮ Online Knapsack Problem Under Concave Functions ⋮ Online unweighted knapsack problem with removal cost ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ Online Maximum Matching with Recourse ⋮ Online budgeted maximum coverage ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ Buyback problem with discrete concave valuation functions ⋮ On the sum minimization version of the online bin covering problem ⋮ Competitive analysis of online real-time scheduling algorithms under hard energy constraint ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ Relaxing the irrevocability requirement for online graph algorithms ⋮ Online Submodular Maximization with Preemption ⋮ Priority algorithms for the subset-sum problem ⋮ Online knapsack problem under concave functions ⋮ Unit cost buyback problem ⋮ Improved online algorithm for fractional knapsack in the random order model ⋮ Online algorithms for the maximum \(k\)-interval coverage problem ⋮ Online generalized assignment problem with historical information ⋮ Online knapsack revisited
This page was built for publication:
