{"id":"https://openalex.org/W1529261801","doi":"https://doi.org/10.1007/978-3-540-68891-4_8","title":"A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem","display_name":"A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem","publication_year":2008,"publication_date":"2008-05-23","ids":{"openalex":"https://openalex.org/W1529261801","doi":"https://doi.org/10.1007/978-3-540-68891-4_8","mag":"1529261801"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-68891-4_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68891-4_8","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":"conference-paper","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":false,"raw_author_name":"Michael Armbruster","raw_affiliation_strings":["Department of Mathematics, Chemnitz University of Technology, Chemnitz, Germany","Chemnitz University of Technology, Department of Mathematics, Chemnitz, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Chemnitz University of Technology, Chemnitz, Germany","institution_ids":["https://openalex.org/I2610724"]},{"raw_affiliation_string":"Chemnitz University of Technology, Department of Mathematics, Chemnitz, Germany#TAB#","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":"Technische Universit\u00e4t 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":["Technische Universit\u00e4t Darmstadt, Department of Mathematics, Darmstadt, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt, Department of Mathematics, Darmstadt, Germany#TAB#","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, Chemnitz, Germany","Chemnitz University of Technology, Department of Mathematics, Chemnitz, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Chemnitz University of Technology, Chemnitz, Germany","institution_ids":["https://openalex.org/I2610724"]},{"raw_affiliation_string":"Chemnitz University of Technology, Department of Mathematics, Chemnitz, Germany#TAB#","institution_ids":["https://openalex.org/I2610724"]}]},{"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":"Technische Universit\u00e4t 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, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","Technische Universit\u00e4t Darmstadt, Department of Mathematics, Darmstadt, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt, Department of Mathematics, Darmstadt, Germany#TAB#","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.8977,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.82156574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"112","last_page":"124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9993000030517578,"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.9987000226974487,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.7835021018981934},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5984430313110352},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.5927087068557739},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.588142454624176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5331356525421143},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5315632224082947},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5078974366188049},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5072571635246277},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.46992623805999756},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4594465494155884},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.4269125163555145},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.39973339438438416},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3522522747516632},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26949962973594666},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.25387710332870483},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.20128804445266724}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7835021018981934},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5984430313110352},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.5927087068557739},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.588142454624176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5331356525421143},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5315632224082947},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5078974366188049},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5072571635246277},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.46992623805999756},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4594465494155884},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.4269125163555145},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.39973339438438416},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3522522747516632},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26949962973594666},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.25387710332870483},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.20128804445266724}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-68891-4_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68891-4_8","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":20,"referenced_works":["https://openalex.org/W64776898","https://openalex.org/W1970801029","https://openalex.org/W1985123706","https://openalex.org/W1991247020","https://openalex.org/W2005064625","https://openalex.org/W2011039300","https://openalex.org/W2012605254","https://openalex.org/W2023425373","https://openalex.org/W2046355282","https://openalex.org/W2051306216","https://openalex.org/W2069107464","https://openalex.org/W2069313750","https://openalex.org/W2084236013","https://openalex.org/W2085595139","https://openalex.org/W2090129250","https://openalex.org/W2132400628","https://openalex.org/W2158598102","https://openalex.org/W2158907148","https://openalex.org/W2222122796","https://openalex.org/W3125870905"],"related_works":["https://openalex.org/W2362705850","https://openalex.org/W3006617646","https://openalex.org/W2379672298","https://openalex.org/W2513180016","https://openalex.org/W2366269287","https://openalex.org/W3126345618","https://openalex.org/W2085647652","https://openalex.org/W1989947834","https://openalex.org/W3000089047","https://openalex.org/W2920857515"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}