Grothendieck-type inequalities in combinatorial optimization
Subhash KhotAssaf NaorPublished in: CoRR (2011)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- metaheuristic
- branch and bound
- optimization problems
- graph theory
- mathematical programming
- branch and bound algorithm
- combinatorial problems
- hard combinatorial optimization problems
- memetic algorithm
- quadratic assignment problem
- sufficient conditions
- max flow min cut
- computer vision
- valid inequalities
- linear inequalities
- ant colony optimization