{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T11:09:30Z","timestamp":1781003370902,"version":"3.54.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0377-2217(97)00358-5","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"134-146","source":"Crossref","is-referenced-by-count":61,"title":["The asymmetric travelling salesman problem and a reformulation of the Miller\u2013Tucker\u2013Zemlin constraints"],"prefix":"10.1016","volume":"112","author":[{"given":"Luis","family":"Gouveia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jose Manuel","family":"Pires","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00358-5_BIB1","unstructured":"Ahuja, R., Magnanti, T., Orlin, J., 1995. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solutions of large scale travelling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Operation Research Letters"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB4","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/moor.16.1.42","article-title":"Facets of the asymmetric traveling salesman problem","volume":"16","author":"Fischetti","year":"1991","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB5","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Toth, P., 1996. A polyhedral approach to the asymmetric traveling salesman problem. Working paper","DOI":"10.1287\/mnsc.43.11.1520"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB6","unstructured":"Gavish, B., Graves, S., 1979. The travelling salesman problem and related problems. Working paper"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB7","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Labb\u00e9, M., Laporte, G., 1995. Efficient heuristics for the design of ring networks. Telecommunication Systems 4, 177\u2013188","DOI":"10.1007\/BF02110085"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB8","doi-asserted-by":"crossref","unstructured":"Gouveia, L., 1995a. A result on projection for the vehicle routing problem. European Journal of Operational Research 85, 610\u2013624","DOI":"10.1016\/0377-2217(94)00025-8"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB9","doi-asserted-by":"crossref","unstructured":"Gouveia, L., 1995b. Using the Miller\u2013Tucker\u2013Zemlin constraints to formulate minimal spanning trees with hop constraints. Computers and Operations Research 22, 959\u2013970","DOI":"10.1016\/0305-0548(94)00074-I"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB10","unstructured":"Grotschel, M., Padberg, M., 1985. Polyhedral theory. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A., Shmoys, D.B. (Eds.), The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(90)90052-7","article-title":"Classification of travelling salesman problem formulation","volume":"9","author":"Langevin","year":"1990","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB12","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A., Shmoys, D.B., 1985. The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York","DOI":"10.2307\/2582681"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB13","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulations and travelling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01582894","article-title":"An analytical comparison of different formulations of the travelling salesman problem","volume":"52","author":"Padberg","year":"1991","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB15","doi-asserted-by":"crossref","unstructured":"Pulleyblank, W., 1989. Polyhedral combinatorics. In: Handbooks in OR and MS, vol. 1. North-Holland, Amsterdam","DOI":"10.1016\/S0927-0507(89)01006-6"},{"key":"10.1016\/S0377-2217(97)00358-5_BIB16","unstructured":"Wong, R., 1980. Integer programming formulations of the travelling salesman problem. In: Proceedings of the IEEE International Conference of Circuits and Computers, pp. 149\u2013152"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003585?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003585?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T22:02:39Z","timestamp":1681164159000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0377221797003585"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00358-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}