Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points.
Lingxiao HuangJian LiPublished in: ICALP (1) (2015)
Keyphrases
- combinatorial optimization problems
- expected values
- knapsack problem
- optimization problems
- combinatorial optimization
- metaheuristic
- discrete optimization
- traveling salesman problem
- ant colony optimization
- continuous optimization problems
- job shop scheduling problem
- job shop scheduling
- finite set of points
- simulated annealing
- data points
- evolutionary algorithm
- shortest path problem
- lower bound
- vehicle routing problem
- np hard
- search space
- computational complexity
- search algorithm
- genetic algorithm