{"id":"https://openalex.org/W7169787870","doi":"https://doi.org/10.48550/arxiv.2607.15837","title":"A Numerically-safe Branch-Price-and-Cut Algorithm for the Length-Constrained Cycle Partition Problem","display_name":"A Numerically-safe Branch-Price-and-Cut Algorithm for the Length-Constrained Cycle Partition Problem","publication_year":2026,"publication_date":"2026-07-17","ids":{"openalex":"https://openalex.org/W7169787870","doi":"https://doi.org/10.48550/arxiv.2607.15837"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.15837","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.15837","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.15837","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112462123","display_name":"Mohammed Ghannam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ghannam, Mohammed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5141171022","display_name":"Ambros Gleixner","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gleixner, Ambros","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083744385","display_name":"Gioni Mexi","orcid":"https://orcid.org/0000-0003-0964-9802"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mexi, Gioni","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004876793","display_name":"Edward Lam","orcid":"https://orcid.org/0000-0002-4485-5014"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lam, Edward","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.5281000137329102,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.5281000137329102,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.20909999310970306,"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.11559999734163284,"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/partition","display_name":"Partition (number theory)","score":0.5999000072479248},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5475000143051147},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45969998836517334},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.43970000743865967},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.42089998722076416},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40389999747276306},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.36469998955726624},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.3562999963760376}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5999000072479248},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5641999840736389},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5475000143051147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5108000040054321},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4724999964237213},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45969998836517334},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.43970000743865967},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.3562999963760376},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.35100001096725464},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.3456000089645386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31790000200271606},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.26739999651908875},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26089999079704285},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2517000138759613},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.15837","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.15837","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.15837","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.15837","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"length-constrained":[1],"cycle":[2,39],"partition":[3],"problem":[4,10,84],"(LCCP)":[5],"is":[6,28,122],"a":[7,13,21,31,56,130,151],"graph":[8],"optimization":[9],"in":[11,49,129],"which":[12,147],"set":[14,57,101],"of":[15,24,37,46,81,99,118,132,146,158],"nodes":[16],"must":[17,40],"be":[18],"partitioned":[19],"into":[20],"minimum":[22],"number":[23],"cycles.":[25],"Every":[26],"node":[27,48],"associated":[29],"with":[30,141],"critical":[32,44],"time":[33,45,134],"and":[34,60,89,109,135],"the":[35,43,50,78,82,96,100,116,119,133,155],"length":[36],"every":[38],"not":[41],"exceed":[42],"any":[47],"cycle.":[51],"We":[52],"formulate":[53],"LCCP":[54],"as":[55],"partitioning":[58,102],"model":[59,103],"solve":[61,125],"it":[62],"using":[63],"an":[64],"exact":[65],"branch-price-and-cut":[66,111],"approach.":[67],"Our":[68],"dynamic":[69],"programming-based":[70],"pricing":[71,83],"algorithm":[72],"to":[73,124],"generate":[74],"improving":[75],"cycles":[76],"exploits":[77],"particular":[79],"structure":[80],"for":[85],"efficient":[86],"bidirectional":[87],"search":[88],"symmetry":[90],"breaking.":[91],"Computational":[92],"results":[93],"show":[94],"that":[95],"LP":[97],"relaxation":[98],"produces":[104],"very":[105],"strong":[106],"dual":[107],"bounds":[108],"our":[110],"method":[112],"improves":[113],"significantly":[114],"over":[115,154],"state":[117],"art.":[120],"It":[121],"able":[123],"previously":[126,138],"solved":[127],"instances":[128,140],"fraction":[131],"closes":[136],"14":[137],"unsolved":[139],"numerically":[142],"safe":[143],"bounds,":[144],"one":[145],"has":[148],"76":[149],"nodes,":[150],"notable":[152],"improvement":[153],"previous":[156],"limit":[157],"52":[159],"nodes.":[160]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-21T00:00:00"}