Robust combinatorial optimization with variable cost uncertainty.
Michael PossPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- branch and bound
- mathematical programming
- combinatorial problems
- robust optimization
- quadratic assignment problem
- branch and bound algorithm
- optimization problems
- metaheuristic
- memetic algorithm
- single machine scheduling problem
- evolutionary algorithm
- pairwise
- cost sensitive
- image segmentation
- neural network
- max flow min cut
- path relinking
- graph theory
- uncertain data
- vehicle routing problem
- heuristic search
- np hard
- objective function
- multiscale
- genetic algorithm