Author:
Bergman David,Cire Andre A.,van Hoeve Willem-Jan
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference24 articles.
1. Akers, S.B. (1978). Binary decision diagrams. IEEE Transactions on Computers, C-27, 509–516.
2. Andersen, H.R., Hadzic, T., Hooker, J.N., & Tiedemann, P. (2007). A constraint store based on multivalued decision diagrams. In Proceedings of the 13th international conference on Principles and practice of constraint programming (pp. 118–132). Springer-Verlag, Berlin, Heidelberg.
3. Becker, B., Behle, M., Eisenbrand, F., & Wimmer, R. (2005). BDDs in a branch and cut framework. In Nikoletseas, S. (Ed.), Experimental and efficient algorithms, proceedings of the 4th international workshop on Efficient and experimental algorithms (WEA 05). Lecture Notes in Computer Science (Vol. 3503, pp. 452–463). Springer.
4. Behle, M. (2007). Binary decision diagrams and integer programming. Ph.D. thesis, Max Planck Institute for Computer Science.
5. Benoist, T., Laburthe, F., & Rottembourg, B. (2001). Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In Proceedings of the 3rd international workshop on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR).
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献