{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T07:57:25Z","timestamp":1783411045738,"version":"3.54.6"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"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":[[1985,9]]},"DOI":"10.1007\/bf01582010","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:05:59Z","timestamp":1114679159000},"page":"43-60","source":"Crossref","is-referenced-by-count":129,"title":["Facets of the linear ordering polytope"],"prefix":"10.1007","volume":"33","author":[{"given":"Martin","family":"Gr\u00f6tschel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0122054","volume":"22","author":"V.J. Bowman","year":"1972","unstructured":"V.J. Bowman, \u201cPermutation polyhedra\u201d, SIAMJournal on Applied Mathematics 22 (1972) 580\u2013589.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR2","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and intractability: A guide to the theory of NP-completeness (Freeman, San Francisco, 1979)."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cOn the acyclic subgraph polytope\u201d, this volume, pp. 28\u201342.","DOI":"10.1007\/BF01582009"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cA cutting plane algorithm for the linear ordering problem\u201d,Operations Research 32 (1984) 1195\u20131220.","journal-title":"Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02932410","volume":"25","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cOptimal triangulation of large real-world input-outputmatrices\u201d,Statistische Hefte 25 (1984) 261\u2013295.","journal-title":"Statistische Hefte"},{"key":"CR6","first-page":"217","volume":"12","author":"B. Korte","year":"1968","unstructured":"B. Korte and W. Oberhofer, \u201cZwei Algorithmen zur L\u00f6sung eines komplexen Reinhenfolgeproblems\u201d,Unternehmensforschung 12 (1968) 217\u2013362.","journal-title":"Unternehmensforschung"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1515\/jbnst-1968-0125","volume":"182","author":"B. Korte","year":"1969","unstructured":"B. Korte and W. Oberhofer, \u201cZur Triangulation von Input-Output Matrizen\u201d,Jahrb\u00fccher f\u00fcr National\u00f6konomie und Statistik 182 (1969) 398\u2013433.","journal-title":"Jahrb\u00fccher f\u00fcr National\u00f6konomie und Statistik"},{"key":"CR8","volume-title":"\u201cThe acyclic subgraph problem\u201d, Report BW26","author":"H.W. Lenstra Jr.","year":"1973","unstructured":"H.W. Lenstra, Jr., \u201cThe acyclic subgraph problem\u201d, Report BW26, Mathematisch Centrum (Amsterdam, 1973)."},{"key":"CR9","volume-title":"Optimisation en analyse ordinale des donn\u00e9es","author":"J.F. Mascotorchino","year":"1979","unstructured":"J.F. Mascotorchino and P. Michaud,Optimisation en analyse ordinale des donn\u00e9es (Masson, Paris, 1979)."},{"key":"CR10","unstructured":"H. Wessels, \u201cTriangulation und Blocktriangulation von Input-Output Tabellen\u201d,Deutsches Institut f\u00fcr Wirtschaftsforschung: Beitr\u00e4ge aur Strukturforschung, Heft 63, Berlin, 1981."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BFb0121198","volume":"8","author":"H.P. Young","year":"1978","unstructured":"H.P. Young, \u201cOn permutations and permutation polytopes\u201d,Mathematical Programming Study 8 (1978) 128\u2013140.","journal-title":"Mathematical Programming Study"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582010.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582010\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T02:51:24Z","timestamp":1625885484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["BF01582010"],"URL":"https:\/\/doi.org\/10.1007\/bf01582010","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}