Using local search to speed up filtering algorithms for some NP-hard constraints

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

Volumn 5015 LNCS, Issue , 2008, Pages 298-302

  Galinier, Philippe ^a   Hertz, Alain ^a   Paroz, Sandrine ^a   Pesant, Gilles ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44649087841     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68155-7_26     Document Type: Conference Paper

References (8)

1. Biro, M., Hujter, M., Zsolt, T.: Precoloring extension 1. interval graphs. Discrete Mathematics 100, 267-279 (1992)
2. Hertz, A., de Werra, D.: Using tabu search for graph coloring. Computing 39, 345-351 (1987)
3. Katriel, I.: Expected-case analysis for delayed filtering. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR, 2006. LNCS, vol. 3990, pp. 119-125. Springer, Heidelberg (2006)
4. Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Applied Mathematics 75, 135-155 (1997)
5. Mahdian, M., Mahmoodian, E.S.: A characterization of uniquely 2-list colorable graphs. Ars Combinatoria 51, 295-305 (1999)
6. Peemoeller, J.: A correction to Brélaz's modification of Brown's coloring algorithm. Communications of the ACM 26(8), 593-597 (1983)
7. Richter, Y., Freund, A., Naveh, Y.: Generalizing alldifferent: The somedifferent constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 468-483. Springer, Heidelberg (2006)
8. Sellmann, M.: Approximated consistency for knapsack constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 679-693. Springer, Heidelberg (2003)