On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems.
Nicole ImmorlicaDavid R. KargerMaria MinkoffVahab S. MirrokniPublished in: SODA (2004)
Keyphrases
- approximation algorithms
- combinatorial optimization problems
- knapsack problem
- np hard
- approximation schemes
- combinatorial optimization
- metaheuristic
- optimization problems
- special case
- exact algorithms
- discrete optimization
- ant colony optimization
- worst case
- job shop scheduling
- vertex cover
- min cost
- randomized algorithms
- approximation ratio
- optimal solution
- primal dual
- traveling salesman problem
- minimum cost
- vehicle routing problem
- job shop scheduling problem
- set cover
- constant factor
- continuous optimization problems
- multistage
- open shop
- minmax regret
- constant factor approximation
- lower bound
- precedence constraints
- branch and bound
- multi objective
- learning algorithm