{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T10:39:46Z","timestamp":1726310386258},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1016\/j.orl.2004.03.007","type":"journal-article","created":{"date-parts":[[2004,8,5]],"date-time":"2004-08-05T00:27:27Z","timestamp":1091665647000},"page":"62-70","source":"Crossref","is-referenced-by-count":63,"title":["New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints"],"prefix":"10.1016","volume":"33","author":[{"given":"Subhash C.","family":"Sarin","sequence":"first","affiliation":[]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[]},{"given":"Ajay","family":"Bhootra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.03.007_BIB1","series-title":"Integer Programming and Combinatorial Optimization","first-page":"19","article-title":"On identifying in polynomial time violated subtour elimination and precedence forcing constraints for the sequential ordering problem","author":"Ascheuer","year":"1990"},{"key":"10.1016\/j.orl.2004.03.007_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1008779125567","article-title":"A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints","volume":"17","author":"Ascheuer","year":"2000","journal-title":"Comput. Optim. Appl"},{"key":"10.1016\/j.orl.2004.03.007_BIB3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01585767","article-title":"The precedence-constrained asymmetric traveling salesman polytope","volume":"68","author":"Balas","year":"1995","journal-title":"Math. Programming"},{"key":"10.1016\/j.orl.2004.03.007_BIB4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0167-6377(01)00106-7","article-title":"Compact vs. exponential-size LP relaxations","volume":"30","author":"Carr","year":"2002","journal-title":"Oper. Res. Lett"},{"key":"10.1016\/j.orl.2004.03.007_BIB5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large scale traveling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Oper. Res"},{"key":"10.1016\/j.orl.2004.03.007_BIB6","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":"1991","journal-title":"Oper. Res. Lett"},{"key":"10.1016\/j.orl.2004.03.007_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02085641","article-title":"A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships","volume":"50","author":"Escudero","year":"1994","journal-title":"Ann. Oper. Res"},{"key":"10.1016\/j.orl.2004.03.007_BIB8","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"},{"key":"10.1016\/j.orl.2004.03.007_BIB9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0166-218X(00)00313-9","article-title":"The asymmetric travelling salesman problem","volume":"112","author":"Gouveia","year":"2001","journal-title":"Discrete Appl. Math"},{"key":"10.1016\/j.orl.2004.03.007_BIB10","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler","year":"1985"},{"key":"10.1016\/j.orl.2004.03.007_BIB11","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. Assoc. Comput. Mach"},{"key":"10.1016\/j.orl.2004.03.007_BIB12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01582894","article-title":"An analytical comparison of different formulations of the traveling salesman problem","volume":"52","author":"Padberg","year":"1992","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/j.orl.2004.03.007_BIB13","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"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704000537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704000537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T00:50:24Z","timestamp":1549327824000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637704000537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["S0167637704000537"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.03.007","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}