Robust combinatorial optimization under convex and discrete cost uncertainty.
Christoph BuchheimJannis KurtzPublished in: EURO J. Comput. Optim. (2018)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- mathematical programming
- robust optimization
- simulated annealing
- branch and bound
- combinatorial problems
- discrete geometry
- branch and bound algorithm
- quadratic assignment problem
- max flow min cut
- optimization problems
- semi definite programming
- exact algorithms
- single machine scheduling problem
- computer vision
- path relinking
- convex sets
- memetic algorithm
- tabu search
- search space
- estimation of distribution algorithms
- graph theory
- search algorithm
- discrete space
- combinatorial search
- image segmentation
- piecewise linear
- hard combinatorial optimization problems
- digital convexity
- vehicle routing problem