Randomized algorithms in combinatorial optimization.
László LovászPublished in: Combinatorial Optimization (1993)
Keyphrases
- combinatorial optimization
- randomized algorithms
- lower bound
- combinatorial optimization problems
- approximation algorithms
- traveling salesman problem
- simulated annealing
- branch and bound algorithm
- combinatorial problems
- metaheuristic
- branch and bound
- worst case
- randomized algorithm
- optimization problems
- practical problems
- hard combinatorial optimization problems
- quadratic assignment problem
- tabu search
- vehicle routing problem
- single machine scheduling problem
- upper bound
- parallel algorithm
- learning algorithm
- online learning