Automatically Exploiting Subproblem Equivalence in Constraint Programming-Reference-Cited by-同舟云学术

Automatically Exploiting Subproblem Equivalence in Constraint Programming

Published:2010 Issue: Volume: Page:71-86
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Chu Geoffrey,de la Banda Maria Garcia,Stuckey Peter J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13520-0_10

Reference19 articles.

1. Lecture Notes in Computer Science;D. Baatar,2007

2. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)

3. Lecture Notes in Computer Science;G. Chu,2009

4. Lecture Notes in Computer Science;T. Fahle,2001

5. Lecture Notes in Computer Science;T. Feydy,2009

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automatic generation of dominance breaking nogoods for a class of constraint optimization problems;Artificial Intelligence;2023-10

2. Generating efficient solvers from constraint models;Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2021-08-18

3. Learning to Solve 3-D Bin Packing Problem via Deep Reinforcement Learning and Constraint Programming;IEEE Transactions on Cybernetics;2021

4. Scheduling double round-robin tournaments with divisional play using constraint programming;European Journal of Operational Research;2017-06

5. Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges;Logic-Based Program Synthesis and Transformation;2015