{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:40:15Z","timestamp":1740264015194,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_39","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"452-463","source":"Crossref","is-referenced-by-count":28,"title":["BDDs in a Branch and Cut Framework"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Behle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Eisenbrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Wimmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding cuts in a branch & cut framework: A computational study with $\\{0, \\frac{1}{2}\\}$ -cuts. Submitted to INFORMS Journal on Computing (2003)"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Mathematical Programming\u00a08, 146\u2013164 (1975)","journal-title":"Mathematical Programming"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers\u00a0C-35, 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"39_CR4","first-page":"143","volume":"49","author":"M. Buro","year":"1993","unstructured":"Buro, M., B\u00fcning, H.K.: Report on a SAT competition. Bulletin of the European Association for Theoretical Computer Science\u00a049, 143\u2013151 (1993)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-25960-2_14","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Codato","year":"2004","unstructured":"Codato, G., Fischetti, M.: Combinatorial benders\u2019 cuts. In: Bienstock, D., Nemhauser, G. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 178\u2013195. Springer, Heidelberg (2004)"},{"issue":"5","key":"39_CR6","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.J., Padberg, M.: Solving large-scale 0-1 linear programming problems. Operations Research\u00a031(5), 803\u2013834 (1983)","journal-title":"Operations Research"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Fujii, H., Ootomo, G., Hori, C.: Interleaving based variable ordering methods for ordered binary decision diagrams. In: Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, pp. 38\u201341 (1993)","DOI":"10.1109\/ICCAD.1993.580028"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society\u00a064, 275\u2013278 (1958)","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"39_CR10","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol.\u00a02. Springer, Heidelberg (1988)"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"Hammer, P.L., Johnson, E., Peled, U.N.: Facets of regular 0-1 polytopes. Mathematical Programming\u00a08, 179\u2013206 (1975)","journal-title":"Mathematical Programming"},{"key":"39_CR12","unstructured":"Herbstritt, M., Kmieciak, T., Becker, B.: On the impact of structural circuit partitioning on SAT-based combinational circuit verification. In: Proceedings of 5th IEEE International Workshop on Microprocessor Test and Verification, Austin, USA (2004)"},{"key":"39_CR13","unstructured":"Hooker, J.N.: Planning and scheduling by logic-based benders decomposition. Working paper (2004)"},{"key":"39_CR14","first-page":"283","volume-title":"Satisfiability in the year 2000","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An online resource for research on SAT. In: Gent, I.P., Walsh, T. (eds.) Satisfiability in the year 2000, pp. 283\u2013292. IOS Press, Amsterdam (2000)"},{"key":"39_CR15","unstructured":"ILOG. CPLEX 9.0 User\u2019s Manual and Reference Manual. S.A (2003)"},{"key":"39_CR16","first-page":"225","volume-title":"Handbook on Operations Research and Management Science","author":"M. J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. In: Handbook on Operations Research and Management Science, vol.\u00a07, pp. 225\u2013330. Elsevier, Amsterdam (1995)"},{"key":"39_CR17","first-page":"1","volume-title":"21st Annual Symposium on Foundations of Computer Science","author":"R.M. Karp","year":"1980","unstructured":"Karp, R.M., Papadimitriou, C.H.: On linear characterizations of combinatorial optimization problems. In: 21st Annual Symposium on Foundations of Computer Science, pp. 1\u20139. IEEE, New York (1980)"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Lai, Y.T., Pedram, M., Vrudhula, S.B.K.: FGILP: an integer linear program solver based on function graphs. In: Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, pp. 685\u2013689 (1993)","DOI":"10.1109\/ICCAD.1993.580162"},{"issue":"8","key":"39_CR19","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1109\/43.298033","volume":"13","author":"Y.T. Lai","year":"1994","unstructured":"Lai, Y.T., Pedram, M., Vrudhula, S.B.K.: EVBDD-based algorithms for integer linear programming, spectral transformation, and functional decomposition. IEEE Trans. on Computer-Aided Design\u00a013(8), 959\u2013975 (1994)","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"39_CR20","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C.Y. Lee","year":"1959","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. The Bell Systems Technical Journal\u00a038, 985\u2013999 (1959)","journal-title":"The Bell Systems Technical Journal"},{"key":"39_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley, Chichester (1988)"},{"key":"39_CR22","unstructured":"Padberg, M.W., Rao, M.R.: The russian method for linear programming III: Bounded integer programming. Technical Report 81-39, New York University, Graduate School of Business and Administration (1981)"},{"issue":"4","key":"39_CR23","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Operations Research\u00a033(4), 842\u2013861 (1985)","journal-title":"Operations Research"},{"issue":"1","key":"39_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591725","volume":"29","author":"M.W. Padberg","year":"1984","unstructured":"Padberg, M.W., Wolsey, L.A.: Fractional covers for forests and matchings. Mathematical Programming\u00a029(1), 1\u201314 (1984)","journal-title":"Mathematical Programming"},{"key":"39_CR25","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, pp. 42\u201347 (1993)"},{"key":"39_CR26","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1986)"},{"key":"39_CR27","unstructured":"Somenzi, F.: CU Decision Diagram Package Release 2.4.0. Department of Electrical and Computer Engineering, University of Colorado at Boulder (2004)"},{"key":"39_CR28","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719789","volume-title":"Branching programs and binary decision diagrams","author":"I. Wegener","year":"2000","unstructured":"Wegener, I.: Branching programs and binary decision diagrams. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)"},{"key":"39_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Faces for a linear inequality in 0-1 variables. Mathematical Programming\u00a08, 165\u2013178 (1975)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:00:33Z","timestamp":1740261633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11427186_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}