Conflict directed backjumping for Max-CSPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 198-203

  Zivan, Roie ^a   Meisels, Amnon ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; CHRONOLOGICAL ORDER; CONFLICT-DIRECTED BACKJUMPING; CONSISTENCY MAINTENANCE; CONSTRAINT OPTIMIZATION PROBLEMS; EXPERIMENTAL EVALUATION; LOCAL CONSISTENCY; MAINTENANCE PROCEDURES;

ARTIFICIAL INTELLIGENCE; BRANCH AND BOUND METHOD; CONSTRAINT SATISFACTION PROBLEMS; LINEAR PROGRAMMING; MAINTENANCE;

ALGORITHMS;

EID: 44449177550     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. C. Bessiere and J.C. Regin. Using bidirectionality to speed up arc-consistency processing. Constraint Processing (LNCS 923), pages 157-169, 1995.
2. X. Chen and P. van Beek. Conflict-directed backjumping revisited. Journal of Artificial Intelligence Research (JAIR), 14:53-81, 2001. (Pubitemid 33738059)
3. R. Dechter and D. Frost. Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence, 136(2):147-188, 2002. (Pubitemid 34232182)
4. Rina Dechter. Constraints Processing. Morgan Kaufman, 2003.
5. M. L. Ginsberg. Dynamic backtracking. J. of Artificial Intelligence Research, 1:25-46, 1993.
6. Christelle Guéret, Narendra Jussien, and Christian Prins. Using intelligent backtracking to improve branch and bound methods: an application to open-shop problems. European Journal of Operational Research, 127(2):344-354, 2000.
7. G. Kondrak and P. van Beek. A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence, 21:365-387, 1997. (Pubitemid 127412238)
8. J. Larrosa and P. Meseguer. Phase transition in max-csp. In Proc. ECAI-96, Budapest, 1996.
9. J. Larrosa and T. Schiex. In the quest of the best form of local consistency for weighted csp. In Proc. IJCAI-2003, Acapulco, 2003.
10. J. Larrosa and T. Schiex. Solving weighted csp by maintaining arc consistency. Artificial Intelligence, 159:1-26, 2004.
11. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible dac for max-csp. Artificial Intelligence, 107:149-163, 1999.
12. H. Li and B. Williams. Generalized conflict learning for hybrid discrete/linear optimization. In CP-2005, pages 415-429, Sigtes (Barcelona), Spain, 2005.
13. P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9:268-299, 1993.
14. R. J. Wallace and E. C. Freuder. Conjunctive width heuristics for maximal constraint satisfaction. In Proc. AAAI-93, pages 762-768, 1993.