-adaptability in stochastic combinatorial optimization under objective uncertainty.
Christoph BuchheimJonas PruentePublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- stochastic nature
- metaheuristic
- combinatorial optimization problems
- simulated annealing
- branch and bound algorithm
- optimization problems
- combinatorial problems
- branch and bound
- mathematical programming
- hard combinatorial optimization problems
- graph theory
- quadratic assignment problem
- max flow min cut
- stochastic simulation
- exact algorithms
- job shop scheduling problem
- stochastic programming
- combinatorial search
- memetic algorithm
- uncertain data
- special case
- neural network