{"id":"https://openalex.org/W1485230108","doi":"https://doi.org/10.1109/cec.2015.7257146","title":"Hard test generation for augmenting path maximum flow algorithms using genetic algorithms: Revisited","display_name":"Hard test generation for augmenting path maximum flow algorithms using genetic algorithms: Revisited","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1485230108","doi":"https://doi.org/10.1109/cec.2015.7257146","mag":"1485230108"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2015.7257146","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7257146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062797646","display_name":"Maxim Buzdalov","orcid":"https://orcid.org/0000-0002-7120-8824"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Maxim Buzdalov","raw_affiliation_strings":["ITMO University, Saint-Petersburg, Russia","ITMO University, 49 Kronverkskiy av., Saint-Petersburg, Russia, 197101"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, Saint-Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"ITMO University, 49 Kronverkskiy av., Saint-Petersburg, Russia, 197101","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000959052","display_name":"Anatoly Shalyto","orcid":"https://orcid.org/0000-0002-2723-2077"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Anatoly Shalyto","raw_affiliation_strings":["ITMO University, Saint-Petersburg, Russia","ITMO University, 49 Kronverkskiy av., Saint-Petersburg, Russia, 197101"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, Saint-Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"ITMO University, 49 Kronverkskiy av., Saint-Petersburg, Russia, 197101","institution_ids":["https://openalex.org/I173089394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1119,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78738822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"11","issue":null,"first_page":"2121","last_page":"2128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10533","display_name":"Teaching and Learning Programming","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7673082947731018},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7174688577651978},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6052525639533997},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5604262948036194},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5547333359718323},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5322926640510559},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5294845700263977},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.505509614944458},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4539371430873871},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2122431993484497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15698546171188354},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15009790658950806},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1474238634109497}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7673082947731018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7174688577651978},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6052525639533997},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5604262948036194},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5547333359718323},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5322926640510559},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5294845700263977},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.505509614944458},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4539371430873871},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2122431993484497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15698546171188354},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15009790658950806},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1474238634109497},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2015.7257146","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7257146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W1970952976","https://openalex.org/W1977545325","https://openalex.org/W2002531683","https://openalex.org/W2042030919","https://openalex.org/W2049084163","https://openalex.org/W2056842119","https://openalex.org/W2085049270","https://openalex.org/W2123806189","https://openalex.org/W2141681789","https://openalex.org/W2149342630","https://openalex.org/W2157263597","https://openalex.org/W2946046356","https://openalex.org/W3014094413","https://openalex.org/W3145128584","https://openalex.org/W4213060235","https://openalex.org/W4213060883","https://openalex.org/W6683381661","https://openalex.org/W6775279221"],"related_works":["https://openalex.org/W2373226645","https://openalex.org/W2590727506","https://openalex.org/W1851375266","https://openalex.org/W2141299097","https://openalex.org/W2355612523","https://openalex.org/W2369278736","https://openalex.org/W2108800124","https://openalex.org/W2095284441","https://openalex.org/W1518391446","https://openalex.org/W4206915070"],"abstract_inverted_index":{"To":[0,24],"estimate":[1],"performance":[2],"of":[3,28,65,68,125,153],"computer":[4],"science":[5],"algorithms":[6,18,53],"reliably,":[7],"one":[8,64,91],"has":[9],"to":[10],"create":[11],"worst-case":[12],"execution":[13],"time":[14],"tests.":[15],"For":[16],"certain":[17],"this":[19,103],"task":[20],"can":[21],"be":[22],"difficult.":[23],"reduce":[25],"the":[26,66,130,134,142,151],"amount":[27],"human":[29],"effort,":[30],"authors":[31],"attempt":[32],"using":[33],"search-based":[34],"optimization":[35],"techniques,":[36],"such":[37],"as":[38,166],"genetic":[39,126],"algorithms.":[40,51],"Our":[41],"previous":[42,135],"paper":[43,136],"addressed":[44],"test":[45,57],"generation":[46,58],"for":[47,56,157],"several":[48],"maximum":[49,69,99,154],"flow":[50,70,100,155],"Genetic":[52],"were":[54,87,129],"applied":[55],"and":[59,84,110,123,145],"showed":[60],"promising":[61],"results.":[62],"However,":[63],"aspects":[67],"algorithm":[71],"implementation":[72],"was":[73],"missing":[74],"in":[75,97,133,141],"that":[76,120],"paper:":[77],"parallel":[78,105],"edges":[79],"(edges":[80],"which":[81,128,158],"share":[82],"source":[83],"target":[85],"vertices)":[86],"not":[88],"merged":[89],"into":[90],"single":[92],"edge":[93,106],"(which":[94],"is":[95,108,118,149],"allowed":[96],"solving":[98],"problems).":[101],"In":[102],"paper,":[104],"merging":[107],"implemented":[109],"new":[111,143],"results":[112],"are":[113,137,162],"reported.":[114],"A":[115],"surprising":[116],"fact":[117],"shown":[119],"fitness":[121],"functions":[122],"choices":[124],"operators":[127],"most":[131],"efficient":[132,140],"much":[138],"less":[139],"setup":[144],"vice":[146],"versa.":[147],"What":[148],"more,":[150],"set":[152],"algorithms,":[156],"significantly":[159],"better":[160],"tests":[161],"generated,":[163],"changed":[164],"completely":[165],"well.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}