{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T21:08:26Z","timestamp":1780607306621,"version":"3.54.1"},"reference-count":8,"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\/bf01582009","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:05:59Z","timestamp":1114679159000},"page":"28-42","source":"Crossref","is-referenced-by-count":83,"title":["On the acyclic subgraph 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","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":"CR2","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cFacets of the linear ordering polytope\u201d, this volume, pp. xx\u2013yy."},{"key":"CR3","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":"CR4","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":"CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization\u201d,Combinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0377-2217(81)90005-9","volume":"8","author":"R. Kaas","year":"1981","unstructured":"R. Kaas, \u201cA branch and bound algorithm for the acyclic subgraph problem\u201d,European Journal of Operational Research 8 (1981) 355\u2013362.","journal-title":"European Journal of Operational Research"},{"key":"CR7","volume-title":"A minimax equality for directed graphs","author":"C.L. Lucchesi","year":"1976","unstructured":"C.L. Lucchesi, \u201cA minimax equality for directed graphs\u201d, Doctoral Thesis, University of Waterloo (Waterloo, Ontario, 1976)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C.L. Lucchesi","year":"1978","unstructured":"C.L. Lucchesi and D.H. Younger, \u201cA minimax relation for directed graphs\u201d,Journal of the London Mathematical Society (2) 17 (1978) 369\u2013374.","journal-title":"Journal of the London Mathematical Society (2)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582009.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582009\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:43Z","timestamp":1556896543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["BF01582009"],"URL":"https:\/\/doi.org\/10.1007\/bf01582009","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}