{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:25:06Z","timestamp":1775579106687,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/cec.2015.7257146","type":"proceedings-article","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T17:22:46Z","timestamp":1442251366000},"page":"2121-2128","source":"Crossref","is-referenced-by-count":4,"title":["Hard test generation for augmenting path maximum flow algorithms using genetic algorithms: Revisited"],"prefix":"10.1109","author":[{"given":"Maxim","family":"Buzdalov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anatoly","family":"Shalyto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"ref12","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12144"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2001858.2002086"},{"key":"ref15","first-page":"300","article-title":"Generation of Tests for Programming Challenge Tasks Using Helper-Objectives","author":"buzdalova","year":"2013","journal-title":"5th International Symposium on Search-Based Software Engineering ser Lecture Notes in Computer Science"},{"key":"ref4","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"dinic","year":"1970","journal-title":"Soviet Math Dokl"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"ref6","year":"0","journal-title":"DIMACS Test generators for the maximum flow problem"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250207"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/321679.321693"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288321"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2351676.2351678"},{"key":"ref1","article-title":"Search based software engineering: A comprehensive analysis and review of trends, technologies and applications","author":"harman","year":"2009","journal-title":"Department of Computer Science King's College London"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2013.180"}],"event":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","location":"Sendai, Japan","start":{"date-parts":[[2015,5,25]]},"end":{"date-parts":[[2015,5,28]]}},"container-title":["2015 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7229815\/7256859\/07257146.pdf?arnumber=7257146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,25]],"date-time":"2017-03-25T00:00:49Z","timestamp":1490400049000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7257146\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/cec.2015.7257146","relation":{},"subject":[],"published":{"date-parts":[[2015,5]]}}}