{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T07:04:19Z","timestamp":1779087859403,"version":"3.51.4"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>We comment on the ACM Journal of Experimental Algorithmics article \u201cAn Exact Method for the Minimum Feedback Arc Set Problem\u201d by Ali Baharev, Hermann Schichl, Arnold Neumaier, and Tobias Achterberg, and we point out that a straightforward implementation of an algorithm we published in 1985, with the same modern technology as used in the article we address, is competitive and mostly superior.<\/jats:p>","DOI":"10.1145\/3545001","type":"journal-article","created":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T12:27:18Z","timestamp":1658924838000},"page":"1-4","source":"Crossref","is-referenced-by-count":4,"title":["Comments on \u201cAn Exact Method for the Minimum Feedback Arc Set Problem\u201d"],"prefix":"10.1145","volume":"27","author":[{"given":"Martin","family":"Gr\u00f6tschel","sequence":"first","affiliation":[{"name":"Institute of Mathematics, Technische Universit\u00e4t Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Universit\u00e4t zu K\u00f6ln, K\u00f6ln, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Universit\u00e4t Heidelberg, Heidelberg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,27]]},"reference":[{"key":"e_1_3_1_2_2","article-title":"Exact and heuristic methods for tearing","author":"Baharev Ali","unstructured":"Ali Baharev. Exact and heuristic methods for tearing. Retrieved June 28, 2021 from https:\/\/github.com\/baharev\/sdopt-tearing.","journal-title":"https:\/\/github.com\/baharev\/sdopt-tearing"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3446429"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.6.1195"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582010"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582009"},{"key":"e_1_3_1_7_2","article-title":"Gurobi Optimizer","author":"Optimization Gurobi","year":"2021","unstructured":"Gurobi Optimization. 2021. Gurobi Optimizer. Retrieved from http:\/\/www.gurobi.com.","journal-title":"Retrieved from http:\/\/www.gurobi.com"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/aic.690190614"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545001","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:43Z","timestamp":1750186963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,27]]},"references-count":7,"alternative-id":["10.1145\/3545001"],"URL":"https:\/\/doi.org\/10.1145\/3545001","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"value":"1084-6654","type":"print"},{"value":"1084-6654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,27]]}}}