{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:01:50Z","timestamp":1761894110148},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993,1]]},"DOI":"10.1007\/bf01581274","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:48:26Z","timestamp":1114681706000},"page":"325-352","source":"Crossref","is-referenced-by-count":33,"title":["A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets"],"prefix":"10.1007","volume":"58","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"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0402038","volume":"2","author":"E. Balas","year":"1989","unstructured":"E. Balas, \u201cThe asymmetric assignment problem and some new facets of the traveling salesman polytope,\u201dSIAM Journal on Discrete Mathematics 2 (1989) 425\u2013451.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"CR2","unstructured":"E. Balas, and M. Fischetti, \u201cThe fixed-outdegree 1-arborescence polytope,\u201d to appear inMathematics of Operations Research."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G. Cornu\u00e9jols","year":"1985","unstructured":"G. Cornu\u00e9jols, J. Fonlupt and D. Naddef, \u201cThe traveling salesman problem on a graph and some related integer polyhedra,\u201dMathematical Programming 33 (1985) 1\u201327.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/moor.16.1.42","volume":"16","author":"M. Fischetti","year":"1991","unstructured":"M. Fischetti, \u201cFacets of the asymmetric traveling salesman polytope,\u201dMathematics of Operations Research 16 (1991) 42\u201356.","journal-title":"Mathematics of Operations Research"},{"key":"CR5","volume-title":"Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme","author":"M. Gr\u00f6tschel","year":"1977","unstructured":"M. Gr\u00f6tschel,Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme (Hain, Maisenheim am Glan, 1977)."},{"key":"CR6","first-page":"33","volume":"21","author":"M. Gr\u00f6tschel","year":"1977","unstructured":"M. Gr\u00f6tschel and M. Padberg, \u201cLineare Charakterisierungen von Travelling Salesman Problemen,\u201dZeitschrift f\u00fcr Operations Research 21 (1977) 33\u201336.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"CR7","first-page":"251","volume-title":"The Traveling Salesman Problem","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel and M. Padberg, \u201cPolyhedral theory,\u201d in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D. Shmoys, eds.,The Traveling Salesman Problem (Wiley, New York, 1985) pp. 251\u2013305."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1287\/moor.11.4.537","volume":"11","author":"M. Gr\u00f6tschel","year":"1986","unstructured":"M. Gr\u00f6tschel and W. Pulleyblank, \u201cClique tree inequalities and the symmetric traveling salesman problem,\u201dMathematics of Operations Research 11 (1986) 537\u2013569.","journal-title":"Mathematics of Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M. Padberg","year":"1990","unstructured":"M. Padberg and G. Rinaldi, \u201cFacet identification for the symmetric traveling salesman polytope,\u201dMathematical Programming 47 (1990) 219\u2013257.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581274.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581274\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:16Z","timestamp":1556896336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["BF01581274"],"URL":"https:\/\/doi.org\/10.1007\/bf01581274","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}