Author:
Thorsteinsson Erlendur S.
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. J. F. Benders. Partitioning procedures for solving mixed-variables programming problems. Numer. Math., 4:238–252, 1962.
2. H. Beringer and B. De Backer. Combinatorial problem solving in constraint logic programming with cooperating solvers. In C. Beierle and L. Plümer, editors, Logic Programming: Formal Methods and Practical Applications, Studies in Computer Science and Artificial Intelligence, chapter 8, pages 245–272. Elsevier, 1995.
3. A. Bockmayr and T. Kasper. Branch-and-infer: A unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing, 10(3):287–300, 1998.
4. K. Darby-Dowman and J. Little. The significance of constraint logic programming to operational research. Operational Research Tutorial Papers, pages 20–45, 1995.
5. K. Darby-Dowman and J. Little. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS Journal on Computing, 10(3):276–286, Summer 1998.
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献