Range-based algorithm for max-CSP

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

Volumn 2470, Issue , 2002, Pages 280-294

  Petit, Thierry ^a,b   Régin, Jean Charles ^a   Bessiére, Christian ^b  

^a IBM   (United States)

^b LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; INFORMATION FILTERING; SCHEDULING; SIGNAL FILTERING AND PREDICTION;

FILTERING ALGORITHM; LARGE AMOUNTS; LOWER BOUNDS; MAX-CSP; RANGE-BASED; SCHEDULING CONSTRAINTS; SOLVING ALGORITHM;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 77956850671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_19     Document Type: Conference Paper

References (5)

1. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible DAC for Max-CSP. Artificial Intelligence, 107:149–163, 1999.
2. J. Larrosa, P. Meseguer, T. Schiex, and G. Verfaillie. Reversible DAC and other improvements for solving Max-CSP. Proceedings AAAI, pages 347–352, 1998.
3. P. Meseguer, J. Larrosa, and M. Sanchez. Lower bounds for non-binary constraint optimization problems. Proceedings CP, pages 317–331, 2001.
4. J.-C. Régin, T. Petit, C. Bessiére, and J.-F. Puget. An original constraint based approach for solving over constrained prolems. Proceedings CP, pages 543–548, 2000.
5. J.-C. Régin, T. Petit, C. Bessiére, and J.-F. Puget. New lower bounds of constraint violations for over constrained prolems. Proceedings CP, pages 332–345, 2001.