{"id":"https://openalex.org/W2333163996","doi":"https://doi.org/10.1145/2851492","title":"A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs","display_name":"A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs","publication_year":2016,"publication_date":"2016-01-29","ids":{"openalex":"https://openalex.org/W2333163996","doi":"https://doi.org/10.1145/2851492","mag":"2333163996"},"language":"en","primary_location":{"id":"doi:10.1145/2851492","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2851492","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5038913111","display_name":"Martin Bergner","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Bergner","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082694588","display_name":"Marco E. L\u00fcbbecke","orcid":"https://orcid.org/0000-0002-2635-0522"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marco E. L\u00dcbbecke","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078493262","display_name":"Jonas Witt","orcid":"https://orcid.org/0000-0002-6152-1702"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jonas T. Witt","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038913111"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03494411,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":null,"first_page":"1","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9958000183105469,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9934999942779541,"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/maximum-cut","display_name":"Maximum cut","score":0.6587147116661072},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6085565686225891},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6038483381271362},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5900667905807495},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5555826425552368},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5495702624320984},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5167328715324402},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5019848346710205},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46832162141799927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4171536862850189},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3965553045272827},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37258076667785645}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6587147116661072},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6085565686225891},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6038483381271362},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5900667905807495},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5555826425552368},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5495702624320984},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5167328715324402},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5019848346710205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46832162141799927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4171536862850189},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3965553045272827},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37258076667785645},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2851492","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2851492","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.706.923","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.706.923","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.or.rwth-aachen.de/research/publications/sea2014-cutpacking.pdf","raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:228049","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/228049","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Experimental Algorithms : 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 \u2013 July 1, 2014 ; Proceedings / ed. by Joachim Gudmundsson, Jyrki Katajainen<br/>13. International Symposium, SEA 2014, Copenhagen, Denmark, 2014-06-29 - 2014-07-01","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:publications.rwth-aachen.de:660356","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/660356","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of experimental algorithmics : JEA 21(1), 1.2 (2016). doi:10.1145/2851492","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W66071877","https://openalex.org/W95318493","https://openalex.org/W1526906841","https://openalex.org/W1556784394","https://openalex.org/W1570425181","https://openalex.org/W1591517876","https://openalex.org/W1605874004","https://openalex.org/W1975433230","https://openalex.org/W1979286451","https://openalex.org/W2003665833","https://openalex.org/W2012355441","https://openalex.org/W2014328192","https://openalex.org/W2040678783","https://openalex.org/W2049716158","https://openalex.org/W2057463094","https://openalex.org/W2061513598","https://openalex.org/W2068262026","https://openalex.org/W2086917808","https://openalex.org/W2091737416","https://openalex.org/W2102948402","https://openalex.org/W2103880351","https://openalex.org/W2117889403","https://openalex.org/W2132022337","https://openalex.org/W2137293391","https://openalex.org/W2145152745","https://openalex.org/W2157520633","https://openalex.org/W2665146460","https://openalex.org/W2913688336","https://openalex.org/W2951311199","https://openalex.org/W4292230561","https://openalex.org/W4388771749","https://openalex.org/W6603842599"],"related_works":["https://openalex.org/W132109778","https://openalex.org/W1989984537","https://openalex.org/W2499670206","https://openalex.org/W2068595367","https://openalex.org/W115807216","https://openalex.org/W4235911878","https://openalex.org/W3210180238","https://openalex.org/W1974139762","https://openalex.org/W2005944337","https://openalex.org/W4286890193"],"abstract_inverted_index":{"The":[0],"cut":[1],"packing":[2],"problem":[3,28],"in":[4,47],"an":[5],"undirected":[6],"graph":[7,71],"is":[8,30],"to":[9,65,80],"find":[10],"a":[11,33,62],"largest":[12],"cardinality":[13],"collection":[14],"of":[15,25,43],"pairwise":[16],"edge-disjoint":[17],"cuts.":[18],"We":[19,60],"provide":[20],"the":[21,41,76,100],"first":[22],"experimental":[23],"study":[24],"this":[26],"NP-hard":[27],"that":[29],"interesting":[31],"from":[32,40,69,75],"pure":[34],"theorist\u2019s":[35],"viewpoint":[36],"as":[37,39],"well":[38],"standpoint":[42],"scientific":[44],"applications":[45],"(e.g.,":[46],"bioinformatics":[48],"and":[49,74,94],"network":[50],"reliability).":[51],"So":[52],"far":[53],"it":[54],"could":[55],"not":[56],"be":[57],"solved":[58],"exactly.":[59],"propose":[61],"branch-price-and-cut":[63],"algorithm":[64],"optimally":[66],"solve":[67],"instances":[68],"various":[70],"classes,":[72],"random":[73],"literature,":[77],"with":[78],"up":[79],"several":[81],"hundred":[82],"vertices.":[83],"In":[84],"particular,":[85],"we":[86],"investigate":[87],"how":[88,95],"complexity":[89],"results":[90],"match":[91],"computational":[92],"experience":[93],"combinatorial":[96],"properties":[97],"help":[98],"improve":[99],"algorithm\u2019s":[101],"performance.":[102]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}