Constructive interval disjunction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4741 LNCS, Issue , 2007, Pages 635-650

  Trombettoni, Gilles ^a   Chabert, Gilles ^b  

^a UNIVERSITÉ CÔTE D'AZUR   (France)

^b ENSIETA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

CONSTRUCTIVE INTERVAL DISJUNCTION; SPLITTING HEURISTIC;

MATHEMATICAL OPERATORS;

EID: 38149089617     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_45     Document Type: Conference Paper

References (17)

1. Barták, R., Erben, R.: A new Algorithm for Singleton Arc Consistency. In: Proc. FLAIRS (2004)
2. Bessière, C., Debruyne, R.: Optimal and Suboptimal Singleton Arc Consistency Algorithms. In: Proc. IJCAI, pp. 54-59 (2005)
3. Debruyne, R., Bessière, C.: Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In: Proc. IJCAI, pp. 412-417 (1997)
4. Geelen, P.A.: Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems. In: Proc. ECAI'92, pp. 31-35 (1992)
5. Granvilliers, L., Benhamou, F.: RealPaver: An Interval Solver using Constraint Satisfaction Techniques. ACM Trans. on Mathematical Software 32(1), 138-156 (2006)
6. Lebbah, Y., Michel, C., Rueher, M.: A Rigorous Global Filtering Algorithm for Quadratic Constraints. Constraints Journal 10(1), 47-65 (2005)
7. Lhomme, O.: Consistency Tech. for Numeric CSPs. In: IJCAI, pp. 232-238 (1993)
8. Lhomme, O.: Quick Shaving. In: Proc. AAAI, pp. 411-415 (2005)
9. Min Li, C., Anbulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. In: Proc. IJCAI, pp. 366-371 (1997)
10. Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)
11. Neveu, B., Chabert, G., Trombettoni, G.: When Interval Analysis helps Interblock Backtracking. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 390-405. Springer, Heidelberg (2006)
12. Web page of COPRIN: www-sop.inria.fr/coprin/logiciels/ALIAS/Benches/ benches.html COCONUT benchs: www.mat.univie.ac.at/~neum/glopt/coconut/Benchmark/ Benchmark.html
13. Refalo, P.: Impact-Based Search Strategies for Constraint Programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557-571. Springer, Heidelberg (2004)
14. Régin, J.C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: Proc. AAAI, pp. 362-367 (1994)
15. Simonis, H.: Sudoku as a Constraint Problem. In: CP Workshop on Modeling and Reformulating Constraint Satisfaction Problems, pp. 13-27 (2005)
16. Van Hentenryck, P., Michel, L., Deville, Y.: Numérica: A Modeling Language for Global Optimization. MIT Press, Cambridge (1997)
17. Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, Implementation, and Evaluation of the Constraint Language CC(FD). J. Logic Programming 37(1-3), 139-164 (1994)