{"id":"https://openalex.org/W7223676098","doi":"https://doi.org/10.48550/arxiv.2610.32165","title":"A branch-and-filter method for mixed-integer linear programming","display_name":"A branch-and-filter method for mixed-integer linear programming","publication_year":2026,"publication_date":"2026-10-23","ids":{"openalex":"https://openalex.org/W7223676098","doi":"https://doi.org/10.48550/arxiv.2610.32165"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.32165","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.32165","pdf_url":"https://arxiv.org/pdf/2610.32165","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.32165","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130980157","display_name":"Nikos Dimou","orcid":"https://orcid.org/0000-0002-0537-3186","observed_orcids":["https://orcid.org/0000-0002-0537-3186"]},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dimou, Nikos","raw_affiliation_strings":["University of North Carolina at Chapel Hill Department of Statistics and Operations Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina at Chapel Hill Department of Statistics and Operations Research","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5130980157"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.0017000000225380063,"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/T10545","display_name":"Optimization and Variational Analysis","score":9.999999747378752e-05,"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/mixed-integer-linear-programming","display_name":"mixed-integer linear programming","score":0.8999999761581421},{"id":"https://openalex.org/keywords/filter-methods","display_name":"filter methods","score":0.6589999794960022},{"id":"https://openalex.org/keywords/tree-search","display_name":"tree search","score":0.6589999794960022},{"id":"https://openalex.org/keywords/global-optimality","display_name":"global optimality","score":0.6380000114440918}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5690000057220459},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.5616000294685364},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5491999983787537},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5365999937057495},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5339000225067139},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5212000012397766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4778999984264374},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.40230000019073486},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.37770000100135803},{"id":"https://openalex.org/C22597639","wikidata":"https://www.wikidata.org/wiki/Q5449227","display_name":"Filter design","level":3,"score":0.3644999861717224},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3634999990463257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3481999933719635},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.32670000195503235},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.2946999967098236},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.28870001435279846},{"id":"https://openalex.org/C36390408","wikidata":"https://www.wikidata.org/wiki/Q1163067","display_name":"Digital filter","level":3,"score":0.2728999853134155},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.25189998745918274},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.32165","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.32165","pdf_url":"https://arxiv.org/pdf/2610.32165","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.32165","doi":"https://doi.org/10.48550/arxiv.2610.32165","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.32165","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,"listed_in":[],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.32165","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.32165","pdf_url":"https://arxiv.org/pdf/2610.32165","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,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7223676098.pdf","grobid_xml":"https://content.openalex.org/works/W7223676098.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2068537726","https://openalex.org/W4388904505","https://openalex.org/W1999049191","https://openalex.org/W4411745416","https://openalex.org/W4292738002","https://openalex.org/W2085637568","https://openalex.org/W2476889170","https://openalex.org/W2058772914","https://openalex.org/W4402177698","https://openalex.org/W2063991361"],"abstract_inverted_index":{"We":[0,121],"develop":[1],"a":[2,13,17,29,53,100,137,139,142],"new":[3],"tree-search":[4],"framework":[5],"for":[6],"mixed-integer":[7,114],"linear":[8,118],"programming":[9,119],"problems,":[10],"which":[11,71],"incorporates":[12],"filter":[14,30,42,64],"mechanism":[15],"as":[16],"node-acceptance":[18],"device.":[19],"The":[20],"introduced":[21,83],"branch-and-filter":[22,132],"algorithm":[23],"combines":[24],"proper":[25],"branching":[26],"actions":[27],"with":[28],"on":[31],"integrality":[32],"violation":[33],"and":[34,65,141],"an":[35,112],"incumbent-dependent":[36],"objective":[37],"coordinate.":[38],"Inspired":[39],"by":[40,62],"classical":[41],"methods":[43],"in":[44,88],"nonconvex":[45],"constrained":[46],"optimization,":[47],"the":[48,63,68,82,129,147],"proposed":[49,148],"method":[50,84],"moves":[51],"to":[52,94,109,127],"restoration":[54,149],"phase":[55],"whenever":[56],"sufficient":[57],"progress":[58],"cannot":[59],"be":[60],"provided":[61],"funnel":[66],"mechanisms,":[67],"latter":[69],"of":[70,106,111,131,146],"is":[72],"anchored":[73],"at":[74],"global":[75,95],"relaxation":[76],"lower":[77],"bounds.":[78],"Under":[79],"mild":[80],"assumptions,":[81],"either":[85],"certifies":[86],"infeasibility":[87],"finitely":[89],"many":[90],"iterations,":[91],"or":[92],"converges":[93],"optimality.":[96],"Moreover,":[97],"we":[98],"establish":[99],"total":[101],"outer":[102],"iteration":[103],"complexity":[104],"bound":[105],"order":[107],"$\\mathcal{O}(\\varepsilon^{-1})$":[108],"certification":[110],"$\\varepsilon$-optimal":[113],"solution":[115],"through":[116],"fixed-integer":[117],"recovery.":[120],"finally":[122],"perform":[123],"several":[124],"numerical":[125],"experiments":[126],"study":[128],"performance":[130],"against":[133],"benchmark":[134],"solvers,":[135],"under":[136],"branch-and-bound,":[138],"branch-and-cut,":[140],"novel":[143],"cell-deletion":[144],"realization":[145],"oracle.":[150]},"counts_by_year":[],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2026-10-27T00:00:00"}