Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference).
Published in: APPROX-RANDOM (2021)
Keyphrases
- combinatorial optimization
- san francisco
- combinatorial optimization problems
- optimization problems
- traveling salesman problem
- exact algorithms
- combinatorial problems
- simulated annealing
- branch and bound algorithm
- branch and bound
- graph theory
- mathematical programming
- metaheuristic
- learning algorithm
- stanford university
- vehicle routing problem
- hard combinatorial optimization problems
- knapsack problem
- error bounds
- international conference
- scheduling problem