On Aligning Non-Order-Associated Binary Decision Diagrams

References

• Akers SB (1978) Binary decision diagrams. IEEE Trans. Comput. 27(6):509–516.Crossref, Google Scholar
• Bergman D, Cire AA (2016) Decomposition based on decision diagrams. Quimper CG, ed. Integration of AI and OR Techniques in Constraint Programming (Springer, Berlin), 45–54.Crossref, Google Scholar
• Bergman D, Cire AA, van Hoeve WJ, Hooker JN (2016) Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms (Springer, Berlin).Crossref, Google Scholar
• Bollig B, Löbbing M, Wegener I (1996) On the effect of local changes in the variable ordering of ordered decision diagrams. Inform. Processing Lett. 59(5):233–239.Crossref, Google Scholar
• Bollig B, Wegener I (1996) Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45(9):993–1002.Crossref, Google Scholar
• Brace KS, Rudell RL, Bryant RE (1990) Efficient implementation of a BDD package. Proc. 27th ACM/IEEE Design Automation Conf. (ACM, New York), 40–45.Google Scholar
• Bryant RE (1986) Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8):677–691.Crossref, Google Scholar
• Bryant RE (1992) Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surveys 24(3):293–318.Crossref, Google Scholar
• Bryant RE (2018) Binary decision diagrams. Clarke EM, Henzinger TA, Veith H, Bloem R, eds. Handbook of Model Checking (Springer, Cham, Switzerland), 191–217.Crossref, Google Scholar
• Cabodi G, Quer S, Meinel C, Sack H, Slobodová A, Stangier C (1998) Binary decision diagrams and the multiple variable order problem. Internat. Workshop Logic Synthesis (ACM, New York), 346–352.Google Scholar
• Drechsler R, Becker B (1998) Binary Decision Diagrams: Theory and Implementation (Kluwer, Dordrecht, Netherlands).Crossref, Google Scholar
• Fujita M, Matsunaga Y, Kakuda T (1991) On variable ordering of binary decision diagrams for the application of multi-level logic synthesis. Proc. Eur. Conf. Design Automation (IEEE, Piscataway, NJ), 50–54.Google Scholar
• Gurobi Optimization, LLC (2020) Gurobi Optimizer reference manual. https://www.gurobi.com/wp-content/plugins/hd_documentations/documentation/9.0/refman.pdf.Google Scholar
• Ishiura N, Sawada H, Yajima S (1991) Minimization of binary decision diagrams based on exchanges of variables. Proc. IEEE Internat. Conf. Comput. Aided Design (IEEE, Piscataway, NJ), 472–475.Google Scholar
• Jung V, Régin JC (2022) Efficient operations between MDDs and constraints. Schaus P, ed. Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Springer, Cham, Switzerland), 173–189.Crossref, Google Scholar
• Knuth DE (2009) Bitwise tricks and techniques; binary decision diagrams. The Art of Computer Programming, vol. 4, 1st ed. (Addison-Wesley, Upper Saddle River, NJ).Google Scholar
• Lee CY (1959) Representation of switching circuits by binary-decision programs. Bell Systems Tech. J. 38(4):985–999.Crossref, Google Scholar
• Lozano L, Bergman D, Smith JC (2020) On the consistent path problem. Oper. Res. 68(6):1913–1931.Link, Google Scholar
• Meinel C, Theobald T (1998) Algorithms and Data Structures in VLSI Design: OBDD—Foundations and Applications (Springer, Berlin).Crossref, Google Scholar
• Minato S (2013) Techniques of BDD/ZDD: Brief history and recent activity. IEICE Trans. Inform. Systems E96-D(7):1419–1429.Crossref, Google Scholar
• Owen SH, Daskin MS (1998) Strategic facility location: A review. Eur. J. Oper. Res. 111(3):423–447.Crossref, Google Scholar
• ReVelle CS, Eiselt HA, Daskin MS (2008) A bibliography for some fundamental problem categories in discrete location science. Eur. J. Oper. Res. 184(3):817–848.Crossref, Google Scholar
• Rudell R (1993) Dynamic variable ordering for ordered binary decision diagrams. Proc. 1993 Internat. Conf. Comput. Aided Design (ICCAD) (IEEE, Piscataway, NJ), 42–47.Google Scholar
• Scholl C, Becker B, Brogle A (2001) The multiple variable order problem for binary decision diagrams: Theory and practical application. Proc. Asia South Pacific Design Automation Conf. 2001 (IEEE, Piscataway, NJ), 85–90.Google Scholar
• Sieling D (2002) The nonapproximability of OBDD minimization. Inform. and Comput. 172(2):103–138.Crossref, Google Scholar
• Wegener I (2000) Branching Programs and Binary Decision Diagrams (SIAM, Philadelphia).Crossref, Google Scholar
• Wegener I (2004) BDDs—design, analysis, complexity, and applications Discrete Appl. Math. 138(1):229–251.Crossref, Google Scholar