{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:18:57Z","timestamp":1778343537538,"version":"3.51.4"},"reference-count":65,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,22]],"date-time":"2020-10-22T00:00:00Z","timestamp":1603324800000},"content-version":"vor","delay-in-days":3065,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s13676-012-0010-0","type":"journal-article","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T01:47:34Z","timestamp":1336960054000},"page":"113-133","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":83,"title":["Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison"],"prefix":"10.1016","volume":"1","author":[{"given":"Roberto","family":"Roberti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13676-012-0010-0_bib1","unstructured":"Applegate D, Bixby R, Chv\u00e1tal V, Cook W (1999) Concorde\u2014a code for solving traveling salesman problems. http:\/\/www.tsp.gatech.edu\/concorde\/index.html"},{"key":"10.1007\/s13676-012-0010-0_bib2","series-title":"Princeton series in applied mathematics","article-title":"The traveling salesman problem: a computational study","author":"Applegate","year":"2007"},{"issue":"4","key":"10.1007\/s13676-012-0010-0_bib3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0402038","article-title":"The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph","volume":"2","author":"Balas","year":"1989","journal-title":"SIAM J Discret Math"},{"key":"10.1007\/s13676-012-0010-0_bib4","unstructured":"Balas E (2000) Personal communication"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584228","article-title":"A restricted Lagrangian approach to the traveling salesman problem","volume":"21","author":"Balas","year":"1981","journal-title":"Math Program Ser A"},{"issue":"1-3","key":"10.1007\/s13676-012-0010-0_bib6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581274","article-title":"A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets","volume":"58","author":"Balas","year":"1993","journal-title":"Math Programm Ser A"},{"key":"10.1007\/s13676-012-0010-0_bib7","series-title":"The Traveling Salesman Problem: a guided tour of combinatorial optimization","first-page":"361","article-title":"Branch and bound methods","author":"Balas","year":"1985"},{"issue":"2","key":"10.1007\/s13676-012-0010-0_bib8","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1287\/opre.19.2.278","article-title":"Pathology of traveling-salesman subtour-elimination algorithms","volume":"19","author":"Bellmore","year":"1971","journal-title":"Oper Res"},{"issue":"7","key":"10.1007\/s13676-012-0010-0_bib9","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","article-title":"Some new branching and bounding criteria for the asymmetric travelling salesman problem","volume":"26","author":"Carpaneto","year":"1980","journal-title":"Manage Sci"},{"issue":"2","key":"10.1007\/s13676-012-0010-0_bib10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0166-218X(87)90016-3","article-title":"Primal-dual algorithms for the assignment problem","volume":"18","author":"Carpaneto","year":"1987","journal-title":"Discret Appl Math"},{"issue":"4","key":"10.1007\/s13676-012-0010-0_bib11","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/212066.212081","article-title":"Exact solution of large-scale asymmetric traveling salesman problems","volume":"21","author":"Carpaneto","year":"1995","journal-title":"ACM Transact Math Softw"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0605004","article-title":"A new formulation for the travelling salesman problem","volume":"5","author":"Claus","year":"1984","journal-title":"SIAM J Algebraic Discret Methods"},{"key":"10.1007\/s13676-012-0010-0_bib13","series-title":"Wiley encyclopedia of operations research and management science","first-page":"738","article-title":"Combinatorial traveling salesman problem algorithms","volume":"1","author":"C","year":"2010"},{"issue":"4","key":"10.1007\/s13676-012-0010-0_bib14","first-page":"393","article-title":"Solutions of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1990","journal-title":"Oper Res Lett"},{"issue":"4","key":"10.1007\/s13676-012-0010-0_bib16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","article-title":"Optimum branchings","volume":"71B","author":"Edmonds","year":"1967","journal-title":"J Res Natl Bur Stand Sec B"},{"key":"10.1007\/s13676-012-0010-0_bib17","first-page":"167","article-title":"A two commodity network flow approach to the travelling salesman problem","volume":"41","author":"Finke","year":"1984","journal-title":"Congressus Numerantium"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib18","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/moor.16.1.42","article-title":"Facets of the asymmetric traveling salesman polytope","volume":"16","author":"Fischetti","year":"1991","journal-title":"Math Oper Res"},{"issue":"2","key":"10.1007\/s13676-012-0010-0_bib19","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.37.2.319","article-title":"An additive bounding procedure for combinatorial optimization problems","volume":"37","author":"Fischetti","year":"1989","journal-title":"Oper Res"},{"issue":"1-3","key":"10.1007\/s13676-012-0010-0_bib20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01585701","article-title":"An additive bounding procedure for the asymmetric travelling salesman problem","volume":"53","author":"Fischetti","year":"1992","journal-title":"Math Program Ser A"},{"key":"10.1007\/s13676-012-0010-0_bib21","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.5.4.426","article-title":"An efficient algorithm for the min-sum arborescence problem","volume":"5","author":"Fischetti","year":"1993","journal-title":"ORSA J Comput"},{"issue":"11","key":"10.1007\/s13676-012-0010-0_bib22","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1287\/mnsc.43.11.1520","article-title":"A polyhedral approach to the asymmetric traveling salesman problem","volume":"43","author":"Fischetti","year":"1997","journal-title":"Manage Sci"},{"issue":"6","key":"10.1007\/s13676-012-0010-0_bib23","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/mnsc.47.6.833.9810","article-title":"A polyhedral approach to simplified crew scheduling and vehicle scheduling problems","volume":"47","author":"Fischetti","year":"2001","journal-title":"Manage Sci"},{"key":"10.1007\/s13676-012-0010-0_bib24","series-title":"The traveling salesman problem and its variations","first-page":"169","article-title":"Exact methods for the asymmetric traveling salesman problem","author":"Fischetti","year":"2002"},{"key":"10.1007\/s13676-012-0010-0_bib25","series-title":"Lecture Notes in Computer Science 2570 Combinatorial Optimization- Eureka, you shrink!","first-page":"64","article-title":"Solving real-world ATSP instances by branch-and-cut","author":"Fischetti","year":"2003"},{"issue":"4","key":"10.1007\/s13676-012-0010-0_bib26","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.28.4.1018","article-title":"An n-constraint formulation of the (time-dependent) traveling salesman problem","volume":"28","author":"Fox","year":"1980","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib27","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.21.1.340","article-title":"On partitioning the feasible set in a branch-and-bound algorithm for the asymmetric traveling-salesman problem","volume":"21","author":"Garfinkel","year":"1973","journal-title":"Oper Res"},{"key":"10.1007\/s13676-012-0010-0_bib28","unstructured":"Gavish B, Graves S (1978) The travelling salesman problem and related problems, working Paper GR-078-78. Operations Research Center, Massachusetts Institute of Technology, Cambridge"},{"key":"10.1007\/s13676-012-0010-0_bib29","doi-asserted-by":"crossref","unstructured":"Godinho MT, Gouveia L, Pesneau P (2011a) Natural and extended formulations for the time-dependent traveling salesman problem. Discret Appl Math doi:10.1016\/j.dam.2011.11.019","DOI":"10.1016\/j.dam.2011.11.019"},{"key":"10.1007\/s13676-012-0010-0_bib30","series-title":"Progress in combinatorial optimization, chap 7","first-page":"223","article-title":"On a time-dependent flow-based formulation and an updated classification of formulations for the travelling salesman problem","author":"Godinho","year":"2011"},{"issue":"3","key":"10.1007\/s13676-012-0010-0_bib31","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/0377-2217(94)00025-8","article-title":"A result on projection for the vehicle routing problem","volume":"85","author":"Gouveia","year":"1995","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13676-012-0010-0_bib32","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/net.20122","article-title":"On extended formulations for the precedence constrained asymmetric traveling salesman problem","volume":"48","author":"Gouveia","year":"2006","journal-title":"Networks"},{"key":"10.1007\/s13676-012-0010-0_bib33","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0377-2217(97)00358-5","article-title":"The asymmetric travelling salesman problem and a reformulation of the Miller\u2013Tucker\u2013Zemlin constraints","volume":"112","author":"Gouveia","year":"1999","journal-title":"Eur J Oper Res"},{"issue":"1\u20133","key":"10.1007\/s13676-012-0010-0_bib34","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0166-218X(00)00313-9","article-title":"The asymmetric travelling salesman problem: on generalizations of disaggregated Miller\u2013Tucker\u2013Zemlin constraints","volume":"112","author":"Gouveia","year":"2001","journal-title":"Discret Appl Math"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib35","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0377-2217(93)E0238-S","article-title":"A classification of formulations for the (time-dependent) travelling salesman problem","volume":"83","author":"Gouveia","year":"1995","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-012-0010-0_bib36","series-title":"The Traveling Salesman Problem: A guided tour of combinatorial optimization","first-page":"251","article-title":"Polyhedral theory","author":"M","year":"1985"},{"key":"10.1007\/s13676-012-0010-0_bib37","series-title":"The traveling salesman problem and its variations","author":"Gutin","year":"2002"},{"issue":"6","key":"10.1007\/s13676-012-0010-0_bib38","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib39","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees: part ii","volume":"1","author":"Held","year":"1971","journal-title":"Math Program Ser A"},{"issue":"4","key":"10.1007\/s13676-012-0010-0_bib40","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0167-6377(83)90048-2","article-title":"Transforming asymmetric into symmetric traveling salesman problems","volume":"2","author":"Jonker","year":"1983","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13676-012-0010-0_bib41","series-title":"Network models, handbooks in operations research and management science","first-page":"255","article-title":"The traveling salesman problem","volume":"7","author":"M","year":"1995"},{"key":"10.1007\/s13676-012-0010-0_bib42","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial optimization problems","author":"Karp","year":"1972"},{"issue":"4","key":"10.1007\/s13676-012-0010-0_bib43","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric traveling-salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM J Comput"},{"key":"10.1007\/s13676-012-0010-0_bib44","unstructured":"Langevin A (1988) Planification des tourn\u00e9es de v\u00e9hicules. PhD thesis, \u00c9cole Polytechnique de Montr\u00e9al, Montreal"},{"issue":"2","key":"10.1007\/s13676-012-0010-0_bib45","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(90)90052-7","article-title":"Classification of travelling salesman problem formulations","volume":"9","author":"Langevin","year":"1990","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13676-012-0010-0_bib46","series-title":"Combinatorial optimization: networks and matroids","author":"Lawler","year":"1976"},{"key":"10.1007\/s13676-012-0010-0_bib47","series-title":"The Traveling Salesman Problem: A guided tour of combinatorial optimization","author":"Lawler","year":"1985"},{"issue":"6","key":"10.1007\/s13676-012-0010-0_bib48","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the traveling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Oper Res"},{"key":"10.1007\/s13676-012-0010-0_bib49","unstructured":"Loulou R (1988) On commodity flow formulations for the TSP, working paper. McGill University, Montr\u00e9al"},{"issue":"4","key":"10.1007\/s13676-012-0010-0_bib50","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"J Ass Comput Mach"},{"issue":"3","key":"10.1007\/s13676-012-0010-0_bib51","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-6377(89)90038-2","article-title":"Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem","volume":"8","author":"Miller","year":"1989","journal-title":"Oper Res Lett"},{"issue":"3","key":"10.1007\/s13676-012-0010-0_bib52","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.cor.2007.11.008","article-title":"A comparative analysis of several asymmetric traveling salesman problem formulations","volume":"36","author":"\u00d6ncan","year":"2009","journal-title":"Comput Oper Res"},{"issue":"1\u20133","key":"10.1007\/s13676-012-0010-0_bib53","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01580850","article-title":"An efficient algorithm for the minimum capacity cut problem","volume":"47","author":"Padberg","year":"1990","journal-title":"Math Program Ser A"},{"issue":"1\u20133","key":"10.1007\/s13676-012-0010-0_bib54","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01580861","article-title":"Facet identification for the symmetric traveling salesman polytope","volume":"47","author":"Padberg","year":"1990","journal-title":"Math Program Ser A"},{"issue":"1\u20133","key":"10.1007\/s13676-012-0010-0_bib55","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":"Math Program Ser A"},{"issue":"1\u20133","key":"10.1007\/s13676-012-0010-0_bib56","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01581188","article-title":"A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems","volume":"55","author":"Pekny","year":"1992","journal-title":"Math Program Ser A"},{"issue":"3","key":"10.1007\/s13676-012-0010-0_bib57","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-6377(91)90035-N","article-title":"A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem","volume":"10","author":"Pekny","year":"1991","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13676-012-0010-0_bib58","doi-asserted-by":"crossref","unstructured":"Reinelt G (1991) TSPLIB - a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/","DOI":"10.1287\/ijoc.3.4.376"},{"key":"10.1007\/s13676-012-0010-0_bib59","series-title":"Lecture Notes in Computer Science","article-title":"The traveling salesman problem: computational solutions for TSP applications","author":"Reinelt","year":"1994"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib60","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.orl.2004.03.007","article-title":"New tighter polynomial length formulations for the asymmetric travelling salesman problem with and without precedence constraints","volume":"33","author":"Sarin","year":"2005","journal-title":"Oper Res Lett"},{"issue":"6","key":"10.1007\/s13676-012-0010-0_bib61","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1287\/opre.50.4.656.2865","article-title":"On tightening the relaxations of Miller\u2013Tucker\u2013Zemlin formulations for asymmetric traveling salesman problems","volume":"50","author":"Sherali","year":"2002","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib62","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.disopt.2005.10.004","article-title":"A class of lifted path and flow-based formulations for the asymmetric travelling salesman problem with and without precedence constraints","volume":"3","author":"Sherali","year":"2006","journal-title":"Discret Optim"},{"key":"10.1007\/s13676-012-0010-0_bib63","series-title":"Studies in Integer Programming, Annals of Discrete Mathematics","first-page":"495","article-title":"Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems","volume":"1","author":"Smith","year":"1977"},{"issue":"1","key":"10.1007\/s13676-012-0010-0_bib64","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230070103","article-title":"Finding optimum branchings","volume":"7","author":"Tarjan","year":"1977","journal-title":"Networks"},{"key":"10.1007\/s13676-012-0010-0_bib65","unstructured":"Wong R (1980) Integer programming formulations of the traveling salesman problem. In: Proceedings of the IEEE international conference of circuits and computers, pp. 149\u2013152"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-012-0010-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-012-0010-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620600115?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620600115?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-012-0010-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:22Z","timestamp":1761882322000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620600115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":65,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["S2192437620600115"],"URL":"https:\/\/doi.org\/10.1007\/s13676-012-0010-0","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2012,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-012-0010-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2012 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}