{"id":"https://openalex.org/W2085021430","doi":"https://doi.org/10.1145/1527125.1527131","title":"Single- and multi-objective evolutionary algorithms for graph bisectioning","display_name":"Single- and multi-objective evolutionary algorithms for graph bisectioning","publication_year":2009,"publication_date":"2009-01-09","ids":{"openalex":"https://openalex.org/W2085021430","doi":"https://doi.org/10.1145/1527125.1527131","mag":"2085021430"},"language":"en","primary_location":{"id":"doi:10.1145/1527125.1527131","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1527125.1527131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms","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/A5066827418","display_name":"Gero Greiner","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Gero Greiner","raw_affiliation_strings":["University of Freiburg, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066827418"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":1.3711,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81116208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"29","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9872000217437744,"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/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6798771023750305},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6032726168632507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5421475172042847},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4822000563144684},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47202247381210327},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4646472632884979},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.45678648352622986},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4254441559314728},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.4235288202762604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3518763482570648},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3450111150741577}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6798771023750305},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6032726168632507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5421475172042847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4822000563144684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47202247381210327},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4646472632884979},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.45678648352622986},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4254441559314728},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4235288202762604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3518763482570648},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3450111150741577}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1527125.1527131","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1527125.1527131","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms","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":21,"referenced_works":["https://openalex.org/W1510977876","https://openalex.org/W1637451315","https://openalex.org/W1951904153","https://openalex.org/W1975791498","https://openalex.org/W1979219118","https://openalex.org/W1995375333","https://openalex.org/W2010350688","https://openalex.org/W2011601876","https://openalex.org/W2024128809","https://openalex.org/W2027988598","https://openalex.org/W2057399436","https://openalex.org/W2075674482","https://openalex.org/W2076588308","https://openalex.org/W2097724176","https://openalex.org/W2105792062","https://openalex.org/W2112263772","https://openalex.org/W2126641717","https://openalex.org/W2161455936","https://openalex.org/W2162189348","https://openalex.org/W2165220807","https://openalex.org/W2169647400"],"related_works":["https://openalex.org/W2084470113","https://openalex.org/W2005659054","https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2391924736","https://openalex.org/W3133779647","https://openalex.org/W1560122427","https://openalex.org/W3041827036","https://openalex.org/W1993493607","https://openalex.org/W2021957875"],"abstract_inverted_index":{"Evolutionary":[0],"algorithms":[1,25,88,100,112,130],"have":[2,76],"been":[3,31,77],"analyzed":[4,114],"for":[5,26,101,131],"many":[6],"optimization":[7,158],"problems":[8,29],"during":[9],"the":[10,20,42,54,66,161,165,177],"last":[11],"decade":[12],"in":[13,89,120],"order":[14,121],"to":[15,40,65,79,122,136,148,155,175],"understand":[16],"their":[17,139],"behavior.":[18],"Recently,":[19],"application":[21],"of":[22,44,56,68,118,128],"multi-objective":[23,108],"evolutionary":[24,87,99,129],"several":[27],"single-objective":[28,69],"has":[30],"investigated.":[32],"The":[33,110],"graph":[34,47,84],"bisection":[35],"problem":[36],"(GBP),":[37],"which":[38],"is":[39,62],"partition":[41],"nodes":[43],"a":[45,103,107,124,151],"given":[46],"into":[48],"two":[49,98,116],"equal-sized":[50],"subsets":[51,61],"such":[52],"that":[53],"number":[55],"edges":[57],"crossing":[58],"between":[59],"these":[60],"minimal,":[63],"belongs":[64],"group":[67],"NP-hard":[70],"problems.":[71],"Heuristics":[72],"like":[73],"Simulated":[74],"Annealing":[75],"proven":[78],"perform":[80],"well":[81,134],"on":[82,115],"certain":[83],"models.":[85],"For":[86],"contrast":[90],"mostly":[91],"experimental":[92],"results":[93,172],"exist.":[94],"This":[95],"paper":[96],"proposes":[97],"GBP,":[102],"(1+1)":[104],"EA":[105],"and":[106,141],"approach.":[109],"proposed":[111],"are":[113,173],"classes":[117],"instances":[119],"provide":[123],"first":[125],"theoretical":[126,178],"analysis":[127],"GBP":[132],"as":[133,135],"point":[137],"out":[138],"advantages":[140],"disadvantages.":[142],"Each":[143],"class":[144],"causes":[145],"one":[146,163],"algorithm":[147],"struggle":[149],"with":[150],"local":[152],"optimum":[153],"leading":[154],"expected":[156],"exponential":[157],"time,":[159],"while":[160],"other":[162],"finds":[164],"optimal":[166],"solution":[167],"within":[168],"polynomial":[169],"time.":[170],"Experimental":[171],"used":[174],"support":[176],"analysis.":[179]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}