A comparison of consistency propagation algorithms in constraint optimization

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

Volumn 2671, Issue , 2003, Pages 160-174

  Zheng, Jingfang ^a   Horsch, Michael C ^a  

^a UNIVERSITY OF SASKATCHEWAN   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONSTRAINED OPTIMIZATION; COMPUTER SCIENCE; MATHEMATICAL MODELS; OPTIMIZATION;

ARC CONSISTENCY; BRANCH AND BOUND SEARCH; CONSTRAINT OPTIMIZATION PROBLEMS; CONSTRAINT OPTIMIZATIONS; CONSTRAINT PROPAGATION; MAINTAINING ARC CONSISTENCIES; PARTIAL ARCS; PROPAGATION ALGORITHM;

OPTIMIZATION; CONSTRAINT THEORY;

CONSTRAINT OPTIMIZATION; CONSTRAINT PROPAGATION; MAXCSP MODELS; PROPAGATION ALGORITHMS;

EID: 7044233046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44886-1_14     Document Type: Conference Paper

References (13)

1. Bessiere, C., and Regin, J.-C. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. CP-1996, Lecture Notes in Computer Science 1118:61-75, 1996.
2. Bistarelli, S.; Montanari, U.; and Rossi, F. Semiring-based constraint satisfaction and optimization. Journal of the ACM 44(2):201-236, 1997.
3. Gent, I., MacIntyre, E., Prosser, P., Smith, S., and Walsh, T. Random Constraint Satisfaction: Flaws and Structure. APES Research Report 98-23, 1998.
4. Givry, S. de, and Verfaille, G. Optimum Anytime Bounding for Constraint Optimization Problems. In Proc. of the AAAI97 workshop on.Building Resource- Bounded Reasoning Systems., Providence, RI. 1997.
5. Horsch, M., Havens, W. and Ghose, A. Generalized Arc Consistency with Applications to MaxCSP and SCSP Instances. In Proceedings of the Fifteenth Canadian Conference on Artificial Intelligence, 2002.
6. K. Kask. New Search Heuristics for Max-CSP In Proceeding of CP’2000, pg. 262-277, 2000.
7. Kumar, V., 1992. Algorithms for Constraint-Satisfaction Problems: A Survey. AI Magazine 13(1):32-44, 1992.
8. Larrossa and P. Meseguer. Partition-based lower bound for max-csp. Proceedings CP, pages 303-315, 1999.
9. Nadel, B. Constraint Satisfaction Algorithms. Computational Intelligence 5:188-224, 1989.
10. Schiex, T., Fargier, H., and Verfaillie, G. Valued constraint satisfaction problems: hard and easy problems. In IJCAI-95, 631-637, 1995.
11. Schiex, T. Arc consistency for soft constraints. In CP-2000, 411-424, 2000.
12. Verfaillie, G.; Lemâõtre, M.; and Schiex, T. Russian doll search. In AAAI-96, 181-187, 1996.
13. Wallace, R. Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems. In CP-1996, pp 482-496, 1996.