{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T07:35:59Z","timestamp":1775979359887,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1007\/bf01585767","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:39:42Z","timestamp":1114677582000},"page":"241-265","source":"Crossref","is-referenced-by-count":92,"title":["The precedence-constrained asymmetric traveling salesman polytope"],"prefix":"10.1007","volume":"68","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Fischetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"N. Ascheuer, L.F. Escudero, M. Gr\u00f6tschel and M. Stoer, \u201cOn identifying in polynomial time violated subtour elimination and precedence forcing constraints for the sequential ordering problem,\u201d in: R. Kannan and W.R. Pulleyblank, eds.,Integer Programming and Combinatioral Optimization (University of Waterloo Press, 1990) 19\u201328."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581274","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas and M. Fischetti, \u201cA lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets,\u201dMathematical Programming 58 (1993) 325\u2013352.","journal-title":"Mathematical Programming"},{"key":"CR3","volume-title":"On identifying and lifting valid cuts for the sequential ordering problem with precedence relationships and deadlines","author":"L. Escudero","year":"1991","unstructured":"L. Escudero, M. Guignard and K. Malik, \u201cOn identifying and lifting valid cuts for the sequential ordering problem with precedence relationships and deadlines,\u201d University of Madrid and IBM Spain, Madrid, Spain (1991)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R. Gomory","year":"1961","unstructured":"R. Gomory and T.C. Hu, \u201cMultiterminal network flows,\u201dSIAM Journal on Applied Mathematics 9 (1961) 551\u2013556.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR5","unstructured":"M.W. Padberg and M. Gr\u00f6tschel, \u201cPolyhedral computations,\u201d in: E.L. Lawler, J.K. Lenstra, A. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem (Wiley, 1985) 307\u2013360."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M.W. Padberg","year":"1990","unstructured":"M.W. Padberg and G. Rinaldi, \u201cFacet identification for the symmetric traveling salesman polytope,\u201dMathematical Programming 47 (1990) 219\u2013257.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"H.N. Psaraftis","year":"1980","unstructured":"H.N. Psaraftis, \u201cA dynamic programming solution to the single-vehicle many-to-many immediate request dial-a-ride problem,\u201dTransportation Science 14 (1980) 130\u2013154.","journal-title":"Transportation Science"},{"key":"CR8","unstructured":"M.T. Fiala Timlin, \u201cPrecedence constrained routing and helicopter scheduling,\u201d M.Sc. Thesis, Department of Combinatorics and Optimization, University of Waterloo (1989)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/inte.22.3.100","volume":"22","author":"M.T. Fiala Timlin","year":"1992","unstructured":"M.T. Fiala Timlin and W.R. Pulleyblank, \u201cPrecedence constrained routing and helicopter scheduling: heuristic design,\u201dInterfaces 22 (1992) 100\u2013111.","journal-title":"Interfaces"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585767.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585767\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:31Z","timestamp":1556897551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["BF01585767"],"URL":"https:\/\/doi.org\/10.1007\/bf01585767","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}