An analytical comparison of different formulations of the travelling sales man problem

Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations

Computers and Operations Research

Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints

Computers and Operations Research

New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints

Computers and Operations Research

Survey of facial results for the traveling salesman polytope

Mathematical and Computer Modelling: An International Journal

On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem

Operations Research Letters

New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints

Operations Research Letters

The multi-flow necessary condition for membership in the pedigree polytope is not sufficient- a counterexample

ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II