Integer Programming Formulation of Traveling Salesman Problems

@article{Miller1960IntegerPF,
title={Integer Programming Formulation of Traveling Salesman Problems},
author={C. E. Miller and A. W. Tucker and R. A. Zemlin},
journal={J. ACM},
year={1960},
volume={7},
pages={326-329}
}

It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems in integer programming, that is, linear programming problems in which some or all of the variables are required to assume integral values. This fact is rendered quite interesting by recent research on such problems, notably by R. E. Gomory [2, 3], which gives promise of yielding efficient computational techniques for their solution. The present paper provides yet… CONTINUE READING