Generating Hard Instances for Robust Combinatorial Optimization.
Marc GoerigkStephen J. MaherPublished in: CoRR (2018)
Keyphrases
- combinatorial optimization
- quadratic assignment problem
- combinatorial optimization problems
- simulated annealing
- traveling salesman problem
- branch and bound algorithm
- metaheuristic
- optimization problems
- mathematical programming
- branch and bound
- memetic algorithm
- combinatorial problems
- neural network
- randomly generated
- exact algorithms
- greedy algorithm
- graph theory
- special case