{"id":"https://openalex.org/W1761805795","doi":"https://doi.org/10.1007/11730095_1","title":"Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem","display_name":"Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1761805795","doi":"https://doi.org/10.1007/11730095_1","mag":"1761805795"},"language":"en","primary_location":{"id":"doi:10.1007/11730095_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11730095_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5083641327","display_name":"Michael Armbruster","orcid":null},"institutions":[{"id":"https://openalex.org/I2610724","display_name":"Chemnitz University of Technology","ror":"https://ror.org/00a208s56","country_code":"DE","type":"education","lineage":["https://openalex.org/I2610724"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Armbruster","raw_affiliation_strings":["Department of Mathematics, Chemnitz University of Technology, D-09107, Chemnitz, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Chemnitz University of Technology, D-09107, Chemnitz, Germany","institution_ids":["https://openalex.org/I2610724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008345521","display_name":"Marzena F\u00fcgenschuh","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marzena F\u00fcgenschuh","raw_affiliation_strings":["Department of Mathematics, Darmstadt University of Technology, D-64289, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Darmstadt University of Technology, D-64289, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058749822","display_name":"Christoph Helmberg","orcid":"https://orcid.org/0000-0002-5288-8000"},"institutions":[{"id":"https://openalex.org/I2610724","display_name":"Chemnitz University of Technology","ror":"https://ror.org/00a208s56","country_code":"DE","type":"education","lineage":["https://openalex.org/I2610724"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Helmberg","raw_affiliation_strings":["Department of Mathematics, Chemnitz University of Technology, D-09107, Chemnitz, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Chemnitz University of Technology, D-09107, Chemnitz, Germany","institution_ids":["https://openalex.org/I2610724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046631661","display_name":"Nikolay Jetchev","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nikolay Jetchev","raw_affiliation_strings":["Department of Mathematics, Darmstadt University of Technology, D-64289, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Darmstadt University of Technology, D-64289, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006197528","display_name":"Alexander Mart\u00edn","orcid":"https://orcid.org/0000-0001-7602-3653"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Martin","raw_affiliation_strings":["Department of Mathematics, Darmstadt University of Technology, D-64289, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Darmstadt University of Technology, D-64289, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5083641327"],"corresponding_institution_ids":["https://openalex.org/I2610724"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4159,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.64277259,"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":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9977999925613403,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9890000224113464,"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/graph-partition","display_name":"Graph partition","score":0.7079206109046936},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.584596574306488},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5674638152122498},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5662914514541626},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5545517206192017},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5522400140762329},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5368874669075012},{"id":"https://openalex.org/keywords/bisection-method","display_name":"Bisection method","score":0.5317161083221436},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5259421467781067},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5208449959754944},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.505568265914917},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.49318641424179077},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.49029162526130676},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4771789312362671},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.46645990014076233},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45037922263145447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44871005415916443},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4126646816730499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34944409132003784},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2845233678817749},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22400689125061035}],"concepts":[{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.7079206109046936},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.584596574306488},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5674638152122498},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5662914514541626},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5545517206192017},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5522400140762329},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5368874669075012},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.5317161083221436},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5259421467781067},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5208449959754944},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.505568265914917},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.49318641424179077},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.49029162526130676},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4771789312362671},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.46645990014076233},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45037922263145447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44871005415916443},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4126646816730499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34944409132003784},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2845233678817749},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22400689125061035},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11730095_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11730095_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W588032555","https://openalex.org/W1572130003","https://openalex.org/W1591939288","https://openalex.org/W1606975040","https://openalex.org/W1989826169","https://openalex.org/W2005064625","https://openalex.org/W2012605254","https://openalex.org/W2046355282","https://openalex.org/W2090236751","https://openalex.org/W2093802669","https://openalex.org/W2134813171","https://openalex.org/W2162136000","https://openalex.org/W2169647400","https://openalex.org/W3125628929","https://openalex.org/W3125870905"],"related_works":["https://openalex.org/W2329494729","https://openalex.org/W3112697985","https://openalex.org/W41290553","https://openalex.org/W2585516632","https://openalex.org/W1986919722","https://openalex.org/W2093663313","https://openalex.org/W40332083","https://openalex.org/W4296983618","https://openalex.org/W2158390333","https://openalex.org/W2577097539"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}