{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:10:55Z","timestamp":1762323055474},"reference-count":24,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,6,27]],"date-time":"2006-06-27T00:00:00Z","timestamp":1151366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2006,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this article we study the use of formulations with precedence relation variables for the Precedence Constrained Asymmetric Travelling Salesman (PCATS) problem. Contrary to previous articles, the emphasis of this article is on formulations involving exponential sized sets of inequalities and on the development of a cutting plane method together with polynomial routines for separating the new inequalities. Our computational results, taken from a set of benchmark instances, show that our methods improve significantly on most of the best previously known lower bound values. \u00a9 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(2), 77\u201389 2006<\/jats:p>","DOI":"10.1002\/net.20122","type":"journal-article","created":{"date-parts":[[2006,6,27]],"date-time":"2006-06-27T23:05:41Z","timestamp":1151449541000},"page":"77-89","source":"Crossref","is-referenced-by-count":31,"title":["On extended formulations for the precedence constrained asymmetric traveling salesman problem"],"prefix":"10.1002","volume":"48","author":[{"given":"L.","family":"Gouveia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Pesneau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,6,27]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"N.Ascheuer Hamiltonian path problems in the on\u2010line optimization of flexible manufacturing systems PhD thesis Tech. Univ. Berlin 1995."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0803002"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008779125567"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585767"},{"key":"e_1_2_1_6_2","first-page":"19","article-title":"Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming","volume":"32","author":"Bianco L.","year":"1994","journal-title":"INFOR"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02592196","article-title":"0\u20131\/2 chvatal\u2010gomory cuts","volume":"74","author":"Caprara A.","year":"1996","journal-title":"Math Program"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0605004"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90083-2"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.43.11.1520"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00358-5"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00313-9"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.6.1195"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582010"},{"key":"e_1_2_1_15_2","first-page":"251","volume-title":"The traveling salesman problem: A guided tour of combinatorial optimization","author":"Gr\u00f6tschel M.","year":"1985"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90052-7"},{"key":"e_1_2_1_17_2","volume-title":"The travelling salesman problem","author":"Lawler E. L.","year":"1985"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.3.365"},{"key":"e_1_2_1_20_2","first-page":"1","article-title":"Projections of extended formulations with precedence variables for the asymmetric traveling salesman problem","volume":"7","author":"Myung Y\u2010S.","year":"2001","journal-title":"Int J Manage Sci"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582894"},{"key":"e_1_2_1_22_2","unstructured":"J. M.Pires Formula\u00e7\u00f5es para o Problema do Caixeiro Viajante Assim\u00e9trico e sua aplica\u00e7\u00e3o a um Problema de Desenho de Redes com Topologia en Forma de Anel PhD thesis Faculdade de Ci\u00eancias da Universidade de Lisboa 2001."},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.03.007"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1287\/inte.22.3.100"},{"key":"e_1_2_1_25_2","unstructured":"R.Wong \u201cInteger programming formulations of the travelling salesman problem \u201d Proceedings of the ieee international conference of circuits and computers 1980 pp.149\u2013152."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20122","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.20122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T07:52:02Z","timestamp":1700034722000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,27]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["10.1002\/net.20122"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/net.20122","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,27]]}}}