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}
}
  • C. E. Miller, A. W. Tucker, R. A. Zemlin
  • Published 1960
  • Mathematics, Computer Science
  • J. ACM
  • 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
    1,274 Citations
    Integer programming formulation of combinatorial optimization problems
    • 48
    Dynamic Programming Treatment of the Travelling Salesman Problem
    • 577
    • PDF
    8 Integer programming
    • 9
    On a Traveling Salesman based Bilevel Programming Problem
    • Highly Influenced
    • PDF
    NEW INTEGER PROGRAMMING FORMULATIONS OF THE GENERALIZED TRAVELING SALESMAN PROBLEM
    • 20
    • PDF
    The indefinite period traveling salesman problem
    • 4