{"id":"https://openalex.org/W4376504100","doi":"https://doi.org/10.1007/s10107-023-01968-y","title":"On computing small variable disjunction branch-and-bound trees","display_name":"On computing small variable disjunction branch-and-bound trees","publication_year":2023,"publication_date":"2023-05-13","ids":{"openalex":"https://openalex.org/W4376504100","doi":"https://doi.org/10.1007/s10107-023-01968-y"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-01968-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-01968-y.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-01968-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032366988","display_name":"Max Gl\u00e4ser","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"funder","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Max Gl\u00e4ser","raw_affiliation_strings":["Department of Mathematics, TU Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033982876","display_name":"Marc E. Pfetsch","orcid":"https://orcid.org/0000-0002-0947-7193"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"funder","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marc E. Pfetsch","raw_affiliation_strings":["Department of Mathematics, TU Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":0.309,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":1,"citation_normalized_percentile":{"value":0.481538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":65,"max":76},"biblio":{"volume":"206","issue":"1-2","first_page":"145","last_page":"173"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9996,"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/T12288","display_name":"Optimization and Search Problems","score":0.9996,"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"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.57234836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3621731}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-01968-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-01968-y.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-023-01968-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-023-01968-y.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[{"funder":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft","award_id":"239904186"}],"datasets":[],"versions":[],"referenced_works_count":26,"referenced_works":["https://openalex.org/W1985572324","https://openalex.org/W1999069928","https://openalex.org/W2005234139","https://openalex.org/W2006912660","https://openalex.org/W2014603110","https://openalex.org/W2060042885","https://openalex.org/W2060514920","https://openalex.org/W2097113315","https://openalex.org/W2115718900","https://openalex.org/W2115826669","https://openalex.org/W2137407595","https://openalex.org/W2143382256","https://openalex.org/W2149701124","https://openalex.org/W2152390092","https://openalex.org/W2167091017","https://openalex.org/W2912540313","https://openalex.org/W3045335116","https://openalex.org/W3081705035","https://openalex.org/W3087527810","https://openalex.org/W3142980271","https://openalex.org/W3162501176","https://openalex.org/W4210891215","https://openalex.org/W4211118908","https://openalex.org/W4244853844","https://openalex.org/W4285295970","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2478288626","https://openalex.org/W2390279801","https://openalex.org/W2382290278","https://openalex.org/W2376932109","https://openalex.org/W2358668433","https://openalex.org/W2350741829","https://openalex.org/W2073681303","https://openalex.org/W2051487156","https://openalex.org/W2001405890"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"article":[2],"investigates":[3],"smallest":[4,82,219],"branch-and-bound":[5,26,64,83,220,257],"trees":[6,27,65,258],"and":[7,36,265],"their":[8],"computation.":[9],"We":[10,39,69,210],"first":[11],"revisit":[12],"the":[13,23,59,78,143,215,239,242],"notion":[14],"of":[15,25,52,61,80,88,217,241],"hiding":[16],"sets":[17],"to":[18,76],"deduce":[19],"lower":[20,43],"bounds":[21,44],"on":[22],"size":[24,79,216,240],"for":[28,45,150,237],"certain":[29],"binary":[30,54],"programs,":[31],"using":[32,66],"both":[33],"variable":[34,46,67],"disjunctions":[35,47],"general":[37],"disjunctions.":[38],"then":[40],"provide":[41],"exponential":[42,145],"by":[48,245],"a":[49,81,86,218],"disjoint":[50],"composition":[51],"smaller":[53],"programs.":[55],"Moreover,":[56],"we":[57,252],"investigate":[58],"complexity":[60],"finding":[62,255,260],"small":[63,256],"disjunctions:":[68],"show":[70,212],"that":[71,213,254],"it":[72],"is":[73,192,223],"not":[74],"possible":[75],"approximate":[77],"tree":[84,221,243],"within":[85],"factor":[87],"$$\\smash":[89,167],"{2^{\\frac{1}{5}n}}$$":[90],"":[92,111,129,156,173,202,227],"":[93,174],"":[94,115,175],"2":[95,116,176,181],"":[96,112,117,130,157,177,203,228],"":[97,134,179],"1":[98,135,180],"5":[99,136],"":[100,137,182],"n":[101,119,186],"":[102,120,123,139,161,187,207,231],"":[103,121,188],"":[104,189],"":[105,124,140,162,190,208,232],"in":[106],"time":[107,146,166],"$$O(2^{\\delta":[108],"n})$$":[109],"O":[113],"(":[114,178],"\u03b4":[118,131],")":[122,185],"with":[125],"$$\\delta":[126],"<\\tfrac{1}{5}$$":[127],"<":[132],"":[133],"":[138],",":[141,163],"unless":[142,194],"strong":[144],"hypothesis":[147],"fails.":[148],"Similarly,":[149],"any":[151],"$$\\varepsilon":[152],">":[153],"0$$":[154],"\u03b5":[158,184],">":[159],"0":[160],"no":[164],"polynomial":[165],"{2^{(\\frac{1}{2}":[168],"-":[169],"\\varepsilon":[170],")n}}$$":[171],"-":[183],"-approximation":[191],"possible,":[193],"$$\\text":[195],"{P}":[196],"=":[197],"\\text":[198],"{NP}":[199],"$$":[200,225],"P":[204],"=":[205],"NP":[206],".":[209],"also":[211],"computing":[214],"exactly":[222],"$${\\#P}":[224],"#":[229],"P":[230],"-hard.":[233],"Similar":[234],"results":[235,268],"hold":[236],"estimating":[238],"produced":[244],"branching":[246],"rules":[247],"like":[248],"most-infeasible":[249],"branching.":[250],"Finally,":[251],"discuss":[253],"generalizes":[259],"short":[261],"treelike":[262],"resolution":[263],"refutations,":[264],"thus":[266],"non-automatizability":[267],"transfer":[269],"from":[270],"this":[271],"setting.":[272]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4376504100","counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-04-22T21:41:12.135653","created_date":"2023-05-15"}