Polytopes in Combinatorial Optimization
Thomas BurgerPeter GritzmannPublished in: Universität Trier, Mathematik/Informatik, Forschungsbericht (1996)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- combinatorial optimization problems
- branch and bound
- simulated annealing
- optimization problems
- metaheuristic
- branch and bound algorithm
- combinatorial problems
- convex hull
- valid inequalities
- mathematical programming
- lattice points
- vehicle routing problem
- graph theory
- memetic algorithm
- combinatorial search
- submodular functions
- neural network
- hard combinatorial optimization problems
- single machine scheduling problem
- exact algorithms
- search algorithm
- computer vision
- genetic algorithm