{"id":"https://openalex.org/W2087132596","doi":"https://doi.org/10.1145/2739482.2768487","title":"Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm","display_name":"Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm","publication_year":2015,"publication_date":"2015-07-10","ids":{"openalex":"https://openalex.org/W2087132596","doi":"https://doi.org/10.1145/2739482.2768487","mag":"2087132596"},"language":"en","primary_location":{"id":"doi:10.1145/2739482.2768487","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2739482.2768487","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2739482.2768487","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2739482.2768487","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066007291","display_name":"Vladimir Mironovich","orcid":"https://orcid.org/0000-0003-2406-9718"},"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":"Vladimir Mironovich","raw_affiliation_strings":["ITMO University, Saint-Petersburg, Russian Fed","ITMO University, Saint Petersburg, Russian Fed.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, Saint-Petersburg, Russian Fed","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"ITMO University, Saint Petersburg, Russian Fed.#TAB#","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"last","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, Russian Fed","ITMO University, Saint Petersburg, Russian Fed.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, Saint-Petersburg, Russian Fed","institution_ids":["https://openalex.org/I173089394"]},{"raw_affiliation_string":"ITMO University, Saint Petersburg, Russian Fed.#TAB#","institution_ids":["https://openalex.org/I173089394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":0.8203,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.7319279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1229","last_page":"1232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9959999918937683,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7960357666015625},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7851752042770386},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.7717838287353516},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5070972442626953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4770883023738861},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.45719873905181885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45181185007095337},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4480316638946533},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.426510751247406},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.225719153881073},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22239404916763306}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7960357666015625},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7851752042770386},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.7717838287353516},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5070972442626953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4770883023738861},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.45719873905181885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45181185007095337},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4480316638946533},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.426510751247406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.225719153881073},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22239404916763306},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2739482.2768487","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2739482.2768487","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2739482.2768487","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.883.8643","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.883.8643","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://is.ifmo.ru/articles_en/2015/gecco15-mironovich-buzdalov.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/2739482.2768487","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2739482.2768487","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2739482.2768487","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1399045467","display_name":null,"funder_award_id":"074-U01","funder_id":"https://openalex.org/F4320321912","funder_display_name":"Ministry of Education and Science of the Russian Federation"}],"funders":[{"id":"https://openalex.org/F4320321912","display_name":"Ministry of Education and Science of the Russian Federation","ror":"https://ror.org/00ghqgy32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2087132596.pdf","grobid_xml":"https://content.openalex.org/works/W2087132596.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W1485230108","https://openalex.org/W1971237725","https://openalex.org/W1977545325","https://openalex.org/W2002531683","https://openalex.org/W2049084163","https://openalex.org/W2085049270","https://openalex.org/W2087605480","https://openalex.org/W2123806189","https://openalex.org/W2149342630","https://openalex.org/W2582743722","https://openalex.org/W2752885492","https://openalex.org/W3014094413","https://openalex.org/W4213060883","https://openalex.org/W6603010030","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W1985939653","https://openalex.org/W2014162767","https://openalex.org/W2115729582","https://openalex.org/W1606499289","https://openalex.org/W2741252017","https://openalex.org/W2911578165","https://openalex.org/W2809283963","https://openalex.org/W2367260997","https://openalex.org/W2626282817","https://openalex.org/W4297582752"],"abstract_inverted_index":{"Most":[0],"evolutionary":[1,31],"algorithms":[2],"not":[3,35],"only":[4],"throw":[5],"out":[6],"insufficiently":[7],"good":[8],"solutions,":[9],"but":[10,74],"forget":[11],"all":[12],"information":[13,25],"they":[14],"obtained":[15],"from":[16,23],"their":[17,21],"evaluation,":[18],"which":[19,33],"reduces":[20],"speed":[22],"the":[24,38,54,67,72,87,96],"theory":[26],"point":[27],"of":[28,56,95],"view.":[29],"An":[30],"algorithm":[32,52],"does":[34],"do":[36],"that,":[37],"1+(\u03bb,\u03b2)":[39,68],"EA":[40,69],"was":[41],"recently":[42],"proposed":[43],"by":[44],"Doerr,":[45],"Doerr":[46],"and":[47],"Ebel.":[48],"We":[49],"evaluate":[50],"this":[51],"on":[53],"problem":[55],"finding":[57],"hard":[58],"tests":[59],"for":[60,83,86],"maximum":[61],"flow":[62],"algorithms.":[63],"Experiments":[64],"show":[65],"that":[66],"is":[70,75,90],"never":[71],"best,":[73],"quite":[76],"stable.":[77],"However,":[78],"its":[79],"adaptive":[80],"version,":[81],"known":[82],"being":[84],"superior":[85],"OneMax":[88],"problem,":[89],"shown":[91],"to":[92],"be":[93],"one":[94],"worst.":[97]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}