An Incremental Model for Combinatorial Maximization Problems

DOI10.1007/11764298_4zbMath1196.90102OpenAlexW1580818183MaRDI QIDQ5307529

Jeff Hartline, Alexa Sharp

Publication date: 14 September 2007

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/5702

zbMATH Keywords

combinatorial problemsanalysis of algorithmsnetwork analysisonline problemsapproximation techniques

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

Packing a Knapsack of Unknown Capacity ⋮ The online knapsack problem with incremental capacity ⋮ Comparison of the genetic algorithm and incremental optimisation routines for a Bayesian inverse modelling based network design ⋮ An incremental version of the \(k\)-center problem on boundary of a convex polygon ⋮ On approximating the incremental knapsack problem ⋮ Approximating the 3-period incremental knapsack problem ⋮ Clairvoyant Mechanisms for Online Auctions ⋮ Approximation schemes for multiperiod binary knapsack problems

This page was built for publication: An Incremental Model for Combinatorial Maximization Problems