{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:24:01Z","timestamp":1765974241017,"version":"3.40.5"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1023\/a:1011315014322","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T09:44:13Z","timestamp":1040636653000},"page":"235-250","source":"Crossref","is-referenced-by-count":18,"title":["A Fast and Effective Algorithm for the Feedback Arc Set Problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Youssef","family":"Saab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Berger, B. and P.W. Shor. (1990). \u201cApproximation Algorithms for the Maximum Acyclic Subgraph Problem.\u201d In Proc. First ACM-SIAM Symp. Discrete Algorithms. pp. 236\u2013243.","key":"332828_CR1"},{"doi-asserted-by":"crossref","unstructured":"Calazans, Ney, et al. (1992). \u201cAdvanced Ordering and Manipulation Techniques for Binary Decision Diagrams.\u201d In European Design Automation Conference, Brussels, Belgium. pp. 452\u2013457.","key":"332828_CR2","DOI":"10.1109\/EDAC.1992.205975"},{"key":"332828_CR3","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., C. Leiserson, and R. Rivest. (1990). Introduction to Algorithms. Cambridge, Mass: The MIT Press."},{"issue":"3\/4","key":"332828_CR4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0045-7825(94)90137-6","volume":"111","author":"C. De Souza","year":"1994","unstructured":"De Souza, C., R. Keunings, L. Wolsey, and O. Zone. (1994). \u201cA New Approach to Minimizing the Frontwidth in Finite Element Calculations.\u201d Computer Methods in Applied Mechanics and Engineering 111(3\/4), 323\u2013334.","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"unstructured":"Eades, P. and X. Lin. (To appear). \u201cAHeuristic for the Feedback Arc Set Problem.\u201dAustralasian J. of Combinatorics.","key":"332828_CR5"},{"key":"332828_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P. Eades","year":"1993","unstructured":"Eades, P., X. Lin, and W.F. Smyth. (1993). \u201cA Fast and Effective Heuristic for the Feedback Arc Set Problem.\u201d Inf. Proc. Lett. 47, 319\u2013323.","journal-title":"Inf. Proc. Lett."},{"key":"332828_CR7","series-title":"Tech. Rept.","volume-title":"Heuristics for the Feedback Arc Set Problem","author":"P. Eades","year":"1989","unstructured":"Eades, P., W.F. Smyth, and X. Lin. (1989). \u201cHeuristics for the Feedback Arc Set Problem.\u201d Tech. Rept. 1, School of Computing Science, Curtin University of Technology, Perth, Western Australia."},{"key":"332828_CR8","volume-title":"Flows in Networks","author":"L. Ford","year":"1962","unstructured":"Ford, L. and D. Fulkerson. (1962). Flows in Networks. Princeton, NJ: Princeton University Press."},{"key":"332828_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY: W. H. Freeman and Company."},{"doi-asserted-by":"crossref","unstructured":"Goldberg, A. and R. Tarjan. (1986). \u201cA New Approach to the Maximum Flow Problem.\u201d In Proc. Eight ACM Symp. on Theory of Computing. pp. 136\u2013146.","key":"332828_CR10","DOI":"10.1145\/12130.12144"},{"issue":"4","key":"332828_CR11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TCT.1966.1082620","volume":"CT-13","author":"A. Lempel","year":"1966","unstructured":"Lempel, A. and I. Cederbaum. (1966). \u201cMinimum Feedback Arc and Vertex Sets of a Directed Graph.\u201d IEEET Trans. Circuit TheoryCT-13(4), 399\u2013403.","journal-title":"IEEET Trans. Circuit Theory"},{"key":"332828_CR12","volume-title":"Doctoral Thesis","author":"C.L. Lucchesi","year":"1976","unstructured":"Lucchesi, C.L. (1976). \u201cA Minimax Equality For Directed Graphs.\u201d Doctoral Thesis, University of Waterloo, Ontario, Canada."},{"issue":"17","key":"332828_CR13","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"2","author":"C.L. Lucchesi","year":"1978","unstructured":"Lucchesi, C.L. and D.H. Younger. (1978). \u201cA Minimax Theorem For Directed Graphs.\u201d J. London Math. Soc. 2(17), 369\u2013374.","journal-title":"J. London Math. Soc."},{"issue":"1","key":"332828_CR14","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/54.199802","volume":"10","author":"B. Mitra","year":"1993","unstructured":"Mitra, B., P. Ranjan Panda, and P. Pal Chaudhuri. (1993). \u201cEstimating the Complexity of Synthesized Designs from FSM Specifications.\u201d IEEE Design & Test of Computers 10(1), 30\u201335.","journal-title":"IEEE Design & Test of Computers"},{"doi-asserted-by":"crossref","unstructured":"Cherabuddi, Raghava V. and Magdy A. Bayoumi. (1994). \u201cAutomated System Partitioning for Synthesis of Multi-Chip Modules.\u201d In Fourth Great Lakes Symposium on VLSI, Design Automation of High Performance VLSI Systems. pp. 21\u201325.","key":"332828_CR15","DOI":"10.1109\/GLSV.1994.290003"},{"key":"332828_CR16","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0196-6774(88)90022-3","volume":"9","author":"V. Ramachandran","year":"1988","unstructured":"Ramachandran, V. (1988). \u201cFinding Minimum Feedback Arc Set in Reducible Flow graphs.\u201d J. Algorithms 9, 299\u2013313.","journal-title":"J. Algorithms"},{"key":"332828_CR17","volume-title":"Doctoral Thesis","author":"Y. Saab","year":"1990","unstructured":"Saab, Y. (1990). \u201cCombinatorial Optimization by Stochastic Evolution with Applications to the Physical Design of VLSI Circuits\u201d. Doctoral Thesis, University of Illinois at Urbana-Champaign."},{"doi-asserted-by":"crossref","unstructured":"Saab, Y. (1993). \u201cPost-Analysis-Based Clustering Dramatically Improves the Fiduccia-Mattheyses Algorithm.\u201d In European Design Automation Conference, Hamburg, Germany. pp. 22\u201327.","key":"332828_CR18","DOI":"10.1109\/EURDAC.1993.410611"},{"issue":"7","key":"332828_CR19","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/12.392848","volume":"44","author":"Y. Saab","year":"1995","unstructured":"Saab, Y. (1995). \u201cA Fast and Robust Network Bisection Algorithm.\u201d IEEE Trans. Computers 44(7), 903\u2013913.","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"332828_CR20","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/43.75636","volume":"10","author":"Y. Saab","year":"1991","unstructured":"Saab, Y. and V. Rao. (1991). \u201cCombinatorial Optimization by Stochastic Evolution.\u201d IEEE Trans. Computer-Aided Design 10(4), 525\u2013535.","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"332828_CR21","volume-title":"Linear Graphs and Electrical Networks","author":"S. Seshu","year":"1961","unstructured":"Seshu, S. and M.B. Reed. (1961). Linear Graphs and Electrical Networks. Reading, Mass: Addison Wesley."},{"key":"332828_CR22","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.3230010204","volume":"1","author":"P. Slater","year":"1971","unstructured":"Slater, P. (1971). \u201cOptimal Ranking of Tournaments.\u201d Networks 1, 135\u2013138.","journal-title":"Networks"},{"key":"332828_CR23","series-title":"Tech. Rept.","volume-title":"A Study of Asynchronous Logical Feedback Networks","author":"S.H. Unger","year":"1957","unstructured":"Unger, S.H. (1957). \u201cA Study of Asynchronous Logical Feedback Networks.\u201d Tech. Rept. 320, Research Lab. of Electronics, MIT, Cambridge, Mass."},{"key":"332828_CR24","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TCT.1963.1082116","volume":"CT-10","author":"D.H. Younger","year":"1963","unstructured":"Younger, D.H. (1963). \u201cMinimum Feedback Arc Sets for a Directed Graph.\u201d IEEE Trans. Circuit Theory CT-10, 238\u2013245.","journal-title":"IEEE Trans. Circuit Theory"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011315014322.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011315014322\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011315014322.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:58:49Z","timestamp":1747652329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011315014322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["332828"],"URL":"https:\/\/doi.org\/10.1023\/a:1011315014322","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}