{"id":"https://openalex.org/W1509061480","doi":"https://doi.org/10.1007/978-3-540-73556-4_15","title":"On Threshold BDDs and the Optimal Variable Ordering Problem","display_name":"On Threshold BDDs and the Optimal Variable Ordering Problem","publication_year":2007,"publication_date":"2007-08-28","ids":{"openalex":"https://openalex.org/W1509061480","doi":"https://doi.org/10.1007/978-3-540-73556-4_15","mag":"1509061480"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-73556-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-73556-4_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-007-9123-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040874575","display_name":"Markus Behle","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Markus Behle","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany","International Max Planck Research School, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"International Max Planck Research School, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040874575"],"corresponding_institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.03288721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"16","issue":"2","first_page":"107","last_page":"118"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.5133000016212463,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10791","display_name":"Advanced Control Systems Optimization","score":0.5133000016212463,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.45210000872612,"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/knapsack-problem","display_name":"Knapsack problem","score":0.7213496565818787},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.720678985118866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5841238498687744},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5483227968215942},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5168607831001282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4916892647743225},{"id":"https://openalex.org/keywords/variable-elimination","display_name":"Variable elimination","score":0.48781445622444153},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48536217212677},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4596189856529236},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4496616721153259},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.44800621271133423},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4353078603744507},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42822641134262085},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4228125214576721},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37239375710487366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3247097134590149},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30829864740371704}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7213496565818787},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.720678985118866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5841238498687744},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5483227968215942},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5168607831001282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4916892647743225},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.48781445622444153},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48536217212677},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4596189856529236},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4496616721153259},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.44800621271133423},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4353078603744507},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42822641134262085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4228125214576721},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37239375710487366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3247097134590149},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30829864740371704},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/978-3-540-73556-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-73556-4_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.1007/s10878-007-9123-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-007-9123-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-007-9123-z.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.2516","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.2516","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~behle/publications/b_cocoa07.pdf","raw_type":"text"},{"id":"pmh:oai:RePEc:spr:jcomop:v:16:y:2008:i:2:d:10.1007_s10878-007-9123-z","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-007-9123-z","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"},{"id":"pmh:oai:edoc.mpg.de:427989","is_oa":false,"landing_page_url":"http://edoc.mpg.de/427989","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, v.16, 107-118 (2008)","raw_type":"Article"},{"id":"pmh:oai:edoc.mpg.de:520601","is_oa":false,"landing_page_url":"http://edoc.mpg.de/520601","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dress, Andreas; Xu, Yinfeng; Zhu, Binhai: First International Conference on Combinatorial Optimization and Applications (COCOA'07), Springer, 124-135 (2007)","raw_type":"Conference-Paper"},{"id":"pmh:oai:edoc.mpg.de:520604","is_oa":false,"landing_page_url":"http://edoc.mpg.de/520604","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, v.16, 107-118 (2008)","raw_type":"Article"},{"id":"pmh:oai:pure.mpg.de:item_1325663","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-1C88-0","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_1328185","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-216E-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:1509061480","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1328185","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"best_oa_location":{"id":"doi:10.1007/s10878-007-9123-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-007-9123-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-007-9123-z.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1509061480.pdf","grobid_xml":"https://content.openalex.org/works/W1509061480.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W143396352","https://openalex.org/W1532594152","https://openalex.org/W1537788028","https://openalex.org/W1766547439","https://openalex.org/W1976629341","https://openalex.org/W2016806954","https://openalex.org/W2080267935","https://openalex.org/W2098022011","https://openalex.org/W2099251677","https://openalex.org/W2109021772","https://openalex.org/W2141472133","https://openalex.org/W4206570602","https://openalex.org/W4214616294"],"related_works":["https://openalex.org/W2997204712","https://openalex.org/W76950382","https://openalex.org/W2068829194","https://openalex.org/W3032367597","https://openalex.org/W3011571374","https://openalex.org/W2605409742","https://openalex.org/W2405621756","https://openalex.org/W2095518912","https://openalex.org/W3079811664","https://openalex.org/W2600844124","https://openalex.org/W2010712525","https://openalex.org/W3132265628","https://openalex.org/W2009528260","https://openalex.org/W1599014020","https://openalex.org/W2145973893","https://openalex.org/W2467858997","https://openalex.org/W3165191782","https://openalex.org/W3199595605","https://openalex.org/W1955121776","https://openalex.org/W2604998762"],"abstract_inverted_index":{"Many":[0],"combinatorial":[1],"optimization":[2],"problems":[3,20,112],"can":[4,46],"be":[5,47],"formulated":[6],"as":[7,120,196],"0/1":[8,158,171,210],"integer":[9],"programs":[10],"(0/1":[11],"IPs).":[12],"The":[13,125],"investigation":[14],"of":[15,18,76,106,127,133,135,166,180,185,222],"the":[16,22,28,131,142,147,175,178,181,217,220],"structure":[17],"these":[19,44,72],"raises":[21],"following":[23],"tasks:":[24],"count":[25],"or":[26],"enumerate":[27],"feasible":[29],"solutions":[30],"and":[31,57,63,92,113,208],"find":[32],"an":[33,77,152,162,197],"optimal":[34,148,163],"solution":[35],"according":[36],"to":[37,199],"a":[38,54,68,82,85,93,121,128,157,167,186,204],"given":[39],"linear":[40,86],"objective":[41],"function.":[42,188],"All":[43],"tasks":[45,73],"accomplished":[48],"using":[49],"binary":[50],"decision":[51],"diagrams":[52],"(BDDs),":[53],"very":[55],"popular":[56],"effective":[58],"datastructure":[59],"in":[60],"computational":[61],"logics":[62],"hardware":[64],"verification.":[65],"We":[66,155,189],"present":[67],"novel":[69],"approach":[70],"for":[71,80,84,160,177,206],"which":[74,202],"consists":[75],"output-sensitive":[78],"algorithm":[79,103],"building":[81],"BDD":[83,129],"constraint":[87],"(a":[88],"so-called":[89],"threshold":[90,98,168,187],"BDD)":[91],"parallel":[94],"AND":[95],"operation":[96],"on":[97,141,214],"BDDs.":[99],"In":[100],"particular":[101],"our":[102,191,223],"is":[104,130,151,203],"capable":[105],"solving":[107],"knapsack":[108,115],"problems,":[109],"subset":[110],"sum":[111],"multidimensional":[114],"problems.":[116],"BDDs":[117],"are":[118],"represented":[119],"directed":[122],"acyclic":[123],"graph.":[124,137],"size":[126],"number":[132],"nodes":[134],"its":[136],"It":[138],"heavily":[139],"depends":[140],"chosen":[143],"variable":[144,149,164,182],"ordering.":[145],"Finding":[146],"ordering":[150,165,183],"NP-hard":[153],"problem.":[154],"derive":[156],"IP":[159,172],"finding":[161],"BDD.":[169],"This":[170],"formulation":[173],"provides":[174],"basis":[176],"computation":[179],"spectrum":[184],"introduce":[190],"new":[192,224],"tool":[193,205],"azove":[194,200],"2.0":[195],"enhancement":[198],"1.1":[201],"counting":[207],"enumerating":[209],"points.":[211],"Computational":[212],"results":[213],"benchmarks":[215],"from":[216],"literature":[218],"show":[219],"strength":[221],"method.":[225]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-02-26T08:16:20.718346","created_date":"2025-10-10T00:00:00"}