Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions.
Ayse N. ArslanMichael PossMarco SilvaPublished in: INFORMS J. Comput. (2022)
Keyphrases
- combinatorial optimization
- combinatorial problems
- combinatorial optimization problems
- simulated annealing
- traveling salesman problem
- optimization problems
- metaheuristic
- branch and bound
- branch and bound algorithm
- estimation of distribution algorithms
- mathematical programming
- combinatorial search
- quadratic assignment problem
- optimal solution
- solution quality
- job shop scheduling problem
- max flow min cut
- hard combinatorial optimization problems
- benchmark problems
- linear program
- multistage
- search algorithm
- solution space
- worst case
- path relinking
- genetic algorithm
- neural network