Approximating Incremental Combinatorial Optimization Problems.
Michel X. GoemansFrancisco UndaPublished in: APPROX-RANDOM (2017)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- optimization problems
- knapsack problem
- metaheuristic
- discrete optimization
- ant colony optimization
- job shop scheduling
- traveling salesman problem
- shortest path problem
- continuous optimization problems
- job shop scheduling problem
- incremental learning
- vehicle routing problem
- exact algorithms
- data structure
- simulated annealing
- upper bound
- dynamic programming
- lower bound
- information retrieval