{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:04:18Z","timestamp":1773655458362,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T00:00:00Z","timestamp":1436572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["074-U01"],"award-info":[{"award-number":["074-U01"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,11]]},"DOI":"10.1145\/2739482.2768487","type":"proceedings-article","created":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T14:10:55Z","timestamp":1436537455000},"page":"1229-1232","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm"],"prefix":"10.1145","author":[{"given":"Vladimir","family":"Mironovich","sequence":"first","affiliation":[{"name":"ITMO University, Saint-Petersburg, Russian Fed."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Buzdalov","sequence":"additional","affiliation":[{"name":"ITMO University, Saint-Petersburg, Russian Fed."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"DIMACS. Test generators for the maximum flow problem. http:\/\/www.informatik.uni-trier.de\/naeher\/Professur\/research\/generators\/maxflow.  DIMACS. Test generators for the maximum flow problem. http:\/\/www.informatik.uni-trier.de\/naeher\/Professur\/research\/generators\/maxflow."},{"key":"e_1_3_2_1_2_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin . Network Flows: Theory, Algorithms, and Applications . Prentice-Hall, Inc. , Upper Saddle River, NJ, USA, 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1993."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2015.7257146"},{"key":"e_1_3_2_1_4_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , 2 nd Ed. MIT Press , Cambridge, Massachusetts , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, 2nd Ed. MIT Press, Cambridge, Massachusetts, 2001.","edition":"2"},{"issue":"5","key":"e_1_3_2_1_5_1","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"Dinic E. A.","year":"1970","unstructured":"E. A. Dinic . Algorithm for solution of a problem of maximum flow in networks with power estimation . Soviet Math. Dokl. , 11 ( 5 ): 1277 -- 1280 , 1970 . E. A. Dinic. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl., 11(5):1277--1280, 1970.","journal-title":"Soviet Math. Dokl."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12144"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288321"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.015"},{"key":"e_1_3_2_1_12_1","unstructured":"R Core Team. R: A language and environment for statistical computing. http:\/\/www.R-project.org\/ 2013.  R Core Team. R: A language and environment for statistical computing. http:\/\/www.R-project.org\/ 2013."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/321679.321693"}],"event":{"name":"GECCO '15: Genetic and Evolutionary Computation Conference","location":"Madrid Spain","acronym":"GECCO '15","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739482.2768487","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2739482.2768487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:51Z","timestamp":1750227411000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2739482.2768487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,11]]},"references-count":13,"alternative-id":["10.1145\/2739482.2768487","10.1145\/2739482"],"URL":"https:\/\/doi.org\/10.1145\/2739482.2768487","relation":{},"subject":[],"published":{"date-parts":[[2015,7,11]]},"assertion":[{"value":"2015-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}