{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T08:31:04Z","timestamp":1759048264883},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,5]],"date-time":"2007-12-05T00:00:00Z","timestamp":1196812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,12,5]],"date-time":"2007-12-05T00:00:00Z","timestamp":1196812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10878-007-9123-z","type":"journal-article","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T16:11:07Z","timestamp":1196957467000},"page":"107-118","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On threshold BDDs and the optimal variable ordering problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Markus","family":"Behle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,5]]},"reference":[{"key":"9123_CR1","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/11427186_39","volume-title":"Proceedings of the 4th international workshop on efficient and experimental algorithms (WEA\u201905)","author":"B Becker","year":"2005","unstructured":"Becker B, Behle M, Eisenbrand F, Wimmer R (2005) BDDs in a branch and cut framework. In: Nikoletseas S (ed) Proceedings of the 4th international workshop on efficient and experimental algorithms (WEA\u201905). Lecture notes in computer science, vol 3503. Springer, Berlin, pp 452\u2013463"},{"key":"9123_CR2","unstructured":"Behle M (2007) Another zero one vertex enumeration tool homepage. http:\/\/www.mpi-inf.mpg.de\/~behle\/azove.html"},{"key":"9123_CR3","first-page":"158","volume-title":"Proceedings of the 9th workshop on algorithm engineering and experiments (ALENEX\u201907)","author":"M Behle","year":"2007","unstructured":"Behle M, Eisenbrand F (2007) 0\/1 vertex and facet enumeration with BDDs. In: Applegate D, Brodal GS, Panario D, Sedgewick R (eds) Proceedings of the 9th workshop on algorithm engineering and experiments (ALENEX\u201907). SIAM, Philadelphia, pp 158\u2013165"},{"issue":"9","key":"9123_CR4","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B Bollig","year":"1996","unstructured":"Bollig B, Wegener I (1996) Improving the variable ordering of OBDDs is NP-complete. IEEE Trans Comput 45(9):993\u20131002","journal-title":"IEEE Trans Comput"},{"key":"9123_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant RE (1986) Graph-based algorithms for Boolean function manipulation. IEEE Trans Comput 35:677\u2013691","journal-title":"IEEE Trans Comput"},{"key":"9123_CR6","first-page":"143","volume":"49","author":"M Buro","year":"1993","unstructured":"Buro M, B\u00fcning HK (1993) Report on a SAT competition. Bull Eur Assoc Theor Comput Sci 49:143\u2013151","journal-title":"Bull Eur Assoc Theor Comput Sci"},{"issue":"12","key":"9123_CR7","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1109\/TCAD.2003.819427","volume":"22","author":"R Ebendt","year":"2003","unstructured":"Ebendt R, G\u00fcnther W, Drechsler R (2003) An improved branch and bound algorithm for exact BDD minimization. IEEE Trans Comput-Aided Des Integr Circuits Syst 22(12):1657\u20131663","journal-title":"IEEE Trans Comput-Aided Des Integr Circuits Syst"},{"key":"9123_CR8","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1145\/37888.37941","volume-title":"Proceedings of the 24th ACM\/IEEE design automation conference","author":"S Friedman","year":"1987","unstructured":"Friedman S, Supowit K (1987) Finding the optimal variable ordering for binary decision diagrams. In: Proceedings of the 24th ACM\/IEEE design automation conference. IEEE Computer Society Press\/ACM, Los Alamitos\/New York, pp 348\u2013356"},{"key":"9123_CR9","first-page":"283","volume-title":"Satisfiability in the year 2000","author":"HH Hoos","year":"2000","unstructured":"Hoos HH, St\u00fctzle T (2000) SATLIB: An online resource for research on SAT. In: Gent IP, Walsh T (eds) Satisfiability in the year 2000. IOS Press, Amsterdam, pp 283\u2013292"},{"key":"9123_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(97)83807-8","volume":"180","author":"K Hosaka","year":"1997","unstructured":"Hosaka K, Takenaga Y, Kaneda T, Yajima S (1997) Size of ordered binary decision diagrams representing threshold functions. Theor Comput Sci 180:47\u201360","journal-title":"Theor Comput Sci"},{"key":"9123_CR11","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"CY Lee","year":"1959","unstructured":"Lee CY (1959) Representation of switching circuits by binary-decision programs. Bell Syst Tech J 38:985\u2013999","journal-title":"Bell Syst Tech J"},{"key":"9123_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58940-9","volume-title":"Algorithms and data structures in VLSI design","author":"C Meinel","year":"1998","unstructured":"Meinel C, Theobald T (1998) Algorithms and data structures in VLSI design. Springer, New York"},{"key":"9123_CR13","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley, New York"},{"key":"9123_CR14","unstructured":"Somenzi F (2005). CU decision diagram package release 2.4.1 homepage. Department of Electrical and Computer Engineering, University of Colorado at Boulder. http:\/\/vlsi.colorado.edu\/~fabio\/CUDD May 2005"},{"issue":"1","key":"9123_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A Urquhart","year":"1987","unstructured":"Urquhart A (1987) Hard examples for resolution. J ACM 34(1):209\u2013219","journal-title":"J ACM"},{"key":"9123_CR16","series-title":"SIAM monographs on discrete mathematics and applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719789","volume-title":"Branching programs and binary decision diagrams","author":"I Wegener","year":"2000","unstructured":"Wegener I (2000) Branching programs and binary decision diagrams. SIAM monographs on discrete mathematics and applications. SIAM, Philadelphia"},{"key":"9123_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on polytopes","author":"GM Ziegler","year":"1995","unstructured":"Ziegler GM (1995) Lectures on polytopes. Springer, New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9123-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-007-9123-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9123-z.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9123-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T19:26:43Z","timestamp":1630438003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-007-9123-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,5]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9123"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9123-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,5]]},"assertion":[{"value":"7 September 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}