On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems.
Hanif D. SheraliPatrick J. DriscollPublished in: Oper. Res. (2002)
Keyphrases
- miller tucker zemlin
- traveling salesman problem
- multi commodity
- combinatorial optimization
- ant colony optimization
- valid inequalities
- linear programming
- optimization problems
- lower bound
- heuristic solution
- hamiltonian cycle
- facility location
- satisfy the triangle inequality
- vehicle routing problem
- distribution network
- max min
- lp relaxation
- network flow problem
- particle swarm optimization
- branch and bound
- np hard
- special case
- objective function