Publication:4737165
From MaRDI portal
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
91A99: Game theory
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Online Knapsack Problem Under Concave Functions, Online Submodular Maximization with Preemption, Packing a Knapsack of Unknown Capacity, Online knapsack revisited, The online knapsack problem with incremental capacity, 2D knapsack: packing squares, Online removable knapsack with limited cuts, Randomized algorithms for online knapsack problems, Online unweighted knapsack problem with removal cost, Online minimization knapsack problem, Online removable square packing, On the sum minimization version of the online bin covering problem, Competitive analysis of online real-time scheduling algorithms under hard energy constraint, Priority algorithms for the subset-sum problem, Online knapsack with resource augmentation, On extensions of the deterministic online model for bipartite matching and max-sat, Buyback problem with discrete concave valuation functions, Online knapsack problem under concave functions, Unit cost buyback problem, Online knapsack of unknown capacity. How to optimize energy consumption in smartphones, Proportional cost buyback problem with weight bounds, The online knapsack problem: advice and randomization, Online removable knapsack problem under convex function
