{"id":"https://openalex.org/W2464436000","doi":"https://doi.org/10.11588/heidok.00012289","title":"Contraction-based Separation and Lifting for Solving the Max-Cut Problem","display_name":"Contraction-based Separation and Lifting for Solving the Max-Cut Problem","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2464436000","doi":"https://doi.org/10.11588/heidok.00012289","mag":"2464436000"},"language":"en","primary_location":{"id":"pmh:oai:archiv.ub.uni-heidelberg.de:12289","is_oa":true,"landing_page_url":null,"pdf_url":"http://archiv.ub.uni-heidelberg.de/volltextserver/12289/1/MaxCut_Thesis_Bonato.pdf","source":{"id":"https://openalex.org/S4306402333","display_name":"heiDOK (Heidelberg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I223822909","host_organization_name":"Heidelberg University","host_organization_lineage":["https://openalex.org/I223822909"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://archiv.ub.uni-heidelberg.de/volltextserver/12289/1/MaxCut_Thesis_Bonato.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057272692","display_name":"Thorsten Bonato","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bonato, Thorsten","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5057272692"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6381,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.727259,"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":null,"last_page":null},"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.9711999893188477,"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.9711999893188477,"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.9384999871253967,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9128999710083008,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/maximum-cut","display_name":"Maximum cut","score":0.9001721143722534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5969192385673523},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5682221055030823},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5357766151428223},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.5351662635803223},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4704493582248688},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.450021356344223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42807066440582275},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.41413506865501404},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4115099012851715},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3824988603591919},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29994356632232666},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2143162190914154}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.9001721143722534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5969192385673523},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5682221055030823},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5357766151428223},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.5351662635803223},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4704493582248688},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.450021356344223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42807066440582275},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.41413506865501404},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4115099012851715},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3824988603591919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29994356632232666},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2143162190914154},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.0},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:archiv.ub.uni-heidelberg.de:12289","is_oa":true,"landing_page_url":null,"pdf_url":"http://archiv.ub.uni-heidelberg.de/volltextserver/12289/1/MaxCut_Thesis_Bonato.pdf","source":{"id":"https://openalex.org/S4306402333","display_name":"heiDOK (Heidelberg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I223822909","host_organization_name":"Heidelberg University","host_organization_lineage":["https://openalex.org/I223822909"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},{"id":"doi:10.11588/heidok.00012289","is_oa":true,"landing_page_url":"https://doi.org/10.11588/heidok.00012289","pdf_url":null,"source":{"id":"https://openalex.org/S7407051545","display_name":"University Library Heidelberg","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2464436000","is_oa":false,"landing_page_url":"http://archiv.ub.uni-heidelberg.de/volltextserver/12289/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:archiv.ub.uni-heidelberg.de:12289","is_oa":true,"landing_page_url":null,"pdf_url":"http://archiv.ub.uni-heidelberg.de/volltextserver/12289/1/MaxCut_Thesis_Bonato.pdf","source":{"id":"https://openalex.org/S4306402333","display_name":"heiDOK (Heidelberg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I223822909","host_organization_name":"Heidelberg University","host_organization_lineage":["https://openalex.org/I223822909"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2464436000.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2967618623","https://openalex.org/W2911404369","https://openalex.org/W3032367597","https://openalex.org/W2951440597","https://openalex.org/W2473290249","https://openalex.org/W2979376188","https://openalex.org/W3034438970","https://openalex.org/W3181036294","https://openalex.org/W2795450728","https://openalex.org/W3013962532","https://openalex.org/W3003658977","https://openalex.org/W2883158837","https://openalex.org/W2312138853","https://openalex.org/W2911868138","https://openalex.org/W3116284897","https://openalex.org/W2969470403","https://openalex.org/W2734879762","https://openalex.org/W3110138576","https://openalex.org/W1582030780","https://openalex.org/W2950233525"],"abstract_inverted_index":{"The":[0],"max-cut":[1,59,97],"problem":[2,8],"is":[3,38,65],"an":[4,90],"NP-hard":[5],"combinatorial":[6],"optimization":[7],"defined":[9],"on":[10,67,99,146],"undirected":[11],"weighted":[12],"graphs.":[13],"It":[14],"consists":[15],"in":[16],"finding":[17],"a":[18,46,54,134,147],"subset":[19,34],"of":[20,29,75,124,142,149],"the":[21,26,30,33,72,121,140],"graph's":[22],"nodes":[23],"such":[24],"that":[25,105],"aggregate":[27],"weight":[28],"edges":[31,88],"between":[32],"and":[35,70,112,128],"its":[36,131],"complement":[37],"maximized.":[39],"In":[40,79],"this":[41,125],"doctoral":[42],"thesis":[43],"we":[44,81,138],"present":[45],"new":[47],"separation":[48,74,144],"approach":[49,127],"to":[50,61,84,89],"be":[51],"used":[52],"within":[53,133],"branch-and-cut":[55,135],"algorithm":[56],"for":[57,109],"solving":[58,96],"problems":[60,98],"optimality.":[62],"This":[63,94],"method":[64],"based":[66],"graph":[68],"contraction":[69],"allows":[71,95],"fast":[73],"so-called":[76],"odd-cycle":[77],"inequalities.":[78],"addition,":[80],"describe":[82],"techniques":[83],"add":[85],"possibly":[86],"missing":[87],"already":[91],"contracted":[92],"graph.":[93],"sparse":[100],"graphs":[101,111],"by":[102],"using":[103],"methods":[104],"were":[106],"originally":[107],"intended":[108],"complete":[110],"could":[113],"not":[114],"have":[115],"been":[116],"applied":[117],"otherwise.":[118],"We":[119],"investigate":[120],"theoretical":[122],"aspects":[123],"combined":[126],"also":[129],"explain":[130],"realization":[132],"framework.":[136],"Finally,":[137],"evaluate":[139],"performance":[141],"our":[143],"procedure":[145],"variety":[148],"test":[150],"instances.":[151]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}