Strong multi-commodity flow formulations for the asymmetric traveling salesman problem.
Ali BalmaSafa Ben SalemMehdi MradTalel LadhariPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- multi commodity
- miller tucker zemlin
- facility location
- heuristic solution
- max min
- network flow problem
- branch and bound
- branch and bound algorithm
- network design problem
- minimum cost
- lower bound
- network design
- network flow
- optimal solution
- lagrangian relaxation
- neural network
- integer programming
- upper bound
- np hard
- search space
- minimal cost