Min max min robust (relative) regret combinatorial optimization.
Alejandro CremaPublished in: Math. Methods Oper. Res. (2020)
Keyphrases
- combinatorial optimization
- min max
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- max min
- branch and bound
- combinatorial problems
- simulated annealing
- multiobjective optimization
- optimization problems
- mathematical programming
- quadratic assignment problem
- branch and bound algorithm
- hard combinatorial optimization problems
- graph theory
- vehicle routing problem
- max flow min cut
- online learning
- exact algorithms
- combinatorial search
- cost function
- lower bound