{"id":"https://openalex.org/W1994932713","doi":"https://doi.org/10.1007/s10479-008-0481-4","title":"A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem","display_name":"A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem","publication_year":2008,"publication_date":"2008-12-02","ids":{"openalex":"https://openalex.org/W1994932713","doi":"https://doi.org/10.1007/s10479-008-0481-4","mag":"1994932713"},"language":"en","primary_location":{"id":"doi:10.1007/s10479-008-0481-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-008-0481-4","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-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/A5084563518","display_name":"Bissan Ghaddar","orcid":"https://orcid.org/0000-0003-4695-200X"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Bissan Ghaddar","raw_affiliation_strings":["Department of Management Sciences, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, Canada, N2L 3G1","Department of Management Sciences University of Waterloo Waterloo Canada"],"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, Canada, N2L 3G1","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Management Sciences University of Waterloo Waterloo Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005540131","display_name":"Miguel F. Anjos","orcid":"https://orcid.org/0000-0002-8258-9116"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Miguel F. Anjos","raw_affiliation_strings":["Department of Management Sciences, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, Canada, N2L 3G1","Department of Management Sciences University of Waterloo Waterloo Canada"],"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, Canada, N2L 3G1","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Management Sciences University of Waterloo Waterloo Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006613126","display_name":"Frauke Liers","orcid":"https://orcid.org/0000-0002-1671-0344"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frauke Liers","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstr. 1, 50969, K\u00f6ln, Germany","Institut f\u00fcr Informatik Universit\u00e4t zu K\u00f6ln K\u00f6ln Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstr. 1, 50969, K\u00f6ln, Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik Universit\u00e4t zu K\u00f6ln K\u00f6ln Germany","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084563518"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":4.5275,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.94172989,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"188","issue":"1","first_page":"155","last_page":"174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6810621619224548},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6254115104675293},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6130858659744263},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5810456275939941},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5266314148902893},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.5121895670890808},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5088968276977539},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5057015419006348},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5045830011367798},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5040675401687622},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.4699532985687256},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4137928783893585},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3519013524055481},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29369184374809265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25515803694725037},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2550773620605469}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6810621619224548},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6254115104675293},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6130858659744263},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5810456275939941},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5266314148902893},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.5121895670890808},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5088968276977539},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5057015419006348},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5045830011367798},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5040675401687622},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.4699532985687256},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4137928783893585},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3519013524055481},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29369184374809265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25515803694725037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2550773620605469},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/s10479-008-0481-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-008-0481-4","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:557","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.122.5363","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.5363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://orion.math.uwaterloo.ca/~hwolkowi/henry/reports/mitacs.d/pdf/Anjos/pub1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.2461","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.2461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.zaik.uni-koeln.de/~paper/unzip.html?file=zaik2007-557.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.432.4312","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.432.4312","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2007/07/1736.pdf","raw_type":"text"},{"id":"pmh:oai:RePEc:spr:annopr:v:188:y:2011:i:1:p:155-174:10.1007/s10479-008-0481-4","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10479-008-0481-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:publications.polymtl.ca:16849","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/16849/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"},{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/2766","is_oa":false,"landing_page_url":"http://hdl.handle.net/10012/2766","pdf_url":null,"source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Master Thesis"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332770","display_name":"Direktion f\u00fcr Entwicklung und Zusammenarbeit","ror":"https://ror.org/03fxa4766"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W56346584","https://openalex.org/W97348994","https://openalex.org/W1518383689","https://openalex.org/W1520090510","https://openalex.org/W1581428370","https://openalex.org/W1601503375","https://openalex.org/W1602308653","https://openalex.org/W1921257436","https://openalex.org/W1967073510","https://openalex.org/W1971565000","https://openalex.org/W1986613675","https://openalex.org/W1993052292","https://openalex.org/W1994932713","https://openalex.org/W1997225065","https://openalex.org/W1999613943","https://openalex.org/W1999913571","https://openalex.org/W2003648292","https://openalex.org/W2004660767","https://openalex.org/W2012605254","https://openalex.org/W2022590561","https://openalex.org/W2031978868","https://openalex.org/W2043471141","https://openalex.org/W2051729348","https://openalex.org/W2063046368","https://openalex.org/W2063117516","https://openalex.org/W2069572432","https://openalex.org/W2069816168","https://openalex.org/W2078289947","https://openalex.org/W2078979423","https://openalex.org/W2125240990","https://openalex.org/W2128202699","https://openalex.org/W2129751437","https://openalex.org/W2132400628","https://openalex.org/W2143075842","https://openalex.org/W2158907148","https://openalex.org/W2159739530","https://openalex.org/W2164209543","https://openalex.org/W2284179770","https://openalex.org/W2402407411","https://openalex.org/W2911404369","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2132400628","https://openalex.org/W579949368","https://openalex.org/W2952554274","https://openalex.org/W3178878483","https://openalex.org/W2920857515","https://openalex.org/W3000089047","https://openalex.org/W1985283864","https://openalex.org/W3110578096","https://openalex.org/W3017511404","https://openalex.org/W2381661070"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}