An application of simultaneous Diophantine approximation in combinatorial optimization.
András FrankÉva TardosPublished in: Comb. (1987)
Keyphrases
- combinatorial optimization
- metaheuristic
- traveling salesman problem
- combinatorial optimization problems
- simulated annealing
- branch and bound
- branch and bound algorithm
- combinatorial problems
- quadratic assignment problem
- optimization problems
- mathematical programming
- submodular functions
- ant colony optimization
- error bounds
- approximation algorithms
- hard combinatorial optimization problems
- single machine scheduling problem
- vehicle routing problem
- job shop scheduling problem
- memetic algorithm
- exact algorithms
- neural network
- path relinking
- lower bound
- genetic algorithm