Author:
Beldiceanu Nicolas,Carlsson Mats,Thiel Sven
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference11 articles.
1. Van Hentenryck P. Constraint programming for combinatorial search problems. Constraints, vol. 2(1). Dordrecht: Kluwer Academic Publishers, 1997, p. 99–101.
2. Beldiceanu N, Carlsson M. Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh T, editor. Proceedings of the seventh CP, vol. 2239 of Lecture Notes in Computer Science. Berlin: Springer; 2001, p. 377–91.
3. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O. Computational geometry—algorithms and applications. Berlin: Springer; 1997.
4. Régin J-C. A filtering algorithm for constraints of difference in CSPs. Proceedings of the 12th national conference on artificial intelligence (AAAI-94), vol. 1. 1994. p. 362–67.
5. Flows in networks;Ford,1963
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献