Compromise solutions for robust combinatorial optimization with variable-sized uncertainty.
André B. ChasseinMarc GoerigkPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- combinatorial optimization
- variable sized
- combinatorial problems
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- mathematical programming
- simulated annealing
- robust optimization
- branch and bound
- path relinking
- optimization problems
- combinatorial search
- branch and bound algorithm
- exact algorithms
- solution space
- benchmark problems
- estimation of distribution algorithms
- vehicle routing problem
- hard combinatorial optimization problems
- genetic algorithm
- max flow min cut
- quadratic assignment problem
- neural network
- job shop scheduling problem
- memetic algorithm
- graph theory
- solution quality
- feasible solution
- constraint satisfaction
- ant colony optimization
- dynamic programming
- search space
- optimal solution