A two‐commodity flow formulation for the traveling salesman and the makespan problems with time windows

This publication has 8 references indexed in Scilit:

• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
  Operations Research, 1992
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
  Operations Research Letters, 1987
• Local search in routing problems with time windows
  Annals of Operations Research, 1985
• A New Formulation for the Travelling Salesman Problem
  SIAM Journal on Algebraic Discrete Methods, 1984
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
  Operations Research, 1983
• The Design of the XMP Linear Programming Library
  ACM Transactions on Mathematical Software, 1981
• State‐space relaxation procedures for the computation of bounds to routing problems
  Networks, 1981
• Solution of a Large-Scale Traveling-Salesman Problem
  Journal of the Operations Research Society of America, 1954