Generating hard instances for robust combinatorial optimization.
Marc GoerigkStephen J. MaherPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- combinatorial optimization
- quadratic assignment problem
- combinatorial optimization problems
- metaheuristic
- traveling salesman problem
- simulated annealing
- combinatorial problems
- branch and bound algorithm
- branch and bound
- optimization problems
- randomly generated
- mathematical programming
- vehicle routing problem
- hard combinatorial optimization problems
- graph theory
- lower bound
- combinatorial search
- np complete
- single machine scheduling problem
- genetic algorithm