1. N. Ascheuer, L.F. Escudero, M. Grötschel and M. Stoer, “On identifying in polynomial time violated subtour elimination and precedence forcing constraints for the sequential ordering problem,” in: R. Kannan and W.R. Pulleyblank, eds.,Integer Programming and Combinatioral Optimization (University of Waterloo Press, 1990) 19–28.
2. E. Balas and M. Fischetti, “A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets,”Mathematical Programming 58 (1993) 325–352.
3. L. Escudero, M. Guignard and K. Malik, “On identifying and lifting valid cuts for the sequential ordering problem with precedence relationships and deadlines,” University of Madrid and IBM Spain, Madrid, Spain (1991).
4. R. Gomory and T.C. Hu, “Multiterminal network flows,”SIAM Journal on Applied Mathematics 9 (1961) 551–556.
5. M.W. Padberg and M. Grötschel, “Polyhedral computations,” in: E.L. Lawler, J.K. Lenstra, A. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem (Wiley, 1985) 307–360.