Extremal Probability Bounds in Combinatorial Optimization.
Divya PadmanabhanSelin Damla AhipasaogluArjun Kodagehalli RamachandraKarthik NatarajanPublished in: SIAM J. Optim. (2022)
Keyphrases
- combinatorial optimization
- graph theory
- traveling salesman problem
- metaheuristic
- combinatorial optimization problems
- simulated annealing
- mathematical programming
- branch and bound
- large deviations
- combinatorial problems
- optimization problems
- branch and bound algorithm
- probability distribution
- lower bound
- vehicle routing problem
- upper bound
- lower and upper bounds
- single machine scheduling problem
- exact algorithms
- path relinking
- combinatorial search
- search space
- randomized algorithm
- expected loss
- hard combinatorial optimization problems
- information theoretic
- worst case
- memetic algorithm
- computer vision