A comparative analysis of several asymmetric traveling salesman problem formulations.
Temel ÖncanI. Kuban AltinelGilbert LaportePublished in: Comput. Oper. Res. (2009)
Keyphrases
- branch and bound algorithm
- mixed integer linear programming
- combinatorial optimization problems
- branch and bound
- optimization methods
- subtour elimination
- computer vision
- cost function
- np hard
- data sets
- artificial intelligence
- face recognition
- lower bound
- ant colony optimization
- traveling salesman problem
- alternative formulations