Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation.
Yasushi KawaseHanna SumitaPublished in: Algorithmica (2024)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- combinatorial problems
- simulated annealing
- quadratic assignment problem
- branch and bound
- branch and bound algorithm
- mathematical programming
- optimization problems
- vehicle routing problem
- max flow min cut
- evolutionary algorithm
- search strategies
- combinatorial search
- graph theory
- shortest path