Existential arc consistency: Getting closer to full arc consistency in weighted CSPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 84-89

  De Givry, Simon ^a   Heras, Federico ^a   Zytnicki, Matthias ^b   Larrosa, Javier ^b  

^a CEMAGREF   (France)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARC CONSISTENCY; BRANCH AND BOUND SEARCH; DEPTH FIRST; SOFT CONSTRAINT;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; LINEAR PROGRAMMING;

CONSTRAINT THEORY;

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

References (9)

1. C. Bessiere and J.C. Regin. Refining the basic constraint propagation algorithm. In IJCAI-01, pages 309-315, 2001.
2. M. Cooper and T. Schiex. Arc consistency for soft constraints. Artificial Intelligence, 154:199-227, 2004.
3. D. Erlenkotter. A Dual-Based Procedure for Uncapacitated Facility Location. Operations Research, 26(6):992-1009, 1978. (Pubitemid 9412214)
4. M. Körkel. On the exact solution of largescale simple plant location problems. European Journal of Operational Research, 39:157-173, 1989.
5. J. Kratica, D. Tosic, V. Filipovic, and I. Ljubic. Solving the Simple Plant Location Problems by Genetic Algorithm. RAIRO Operations Research, 35:127-142, 2001.
6. J. Larrosa and T. Schiex. In the quest of the best form of local consistency for weighted CSP. In IJCAI-03, pages 239-244, 2003.
7. J. Larrosa and T. Schiex. Solving Weighted CSP by Maintaining Arc-consistency. Artificial Intelligence, 159(1-2):1-26, 2004.
8. L. Michel and P. Van Hentenryck. A Simple Tabu Search for Warehouse Location. European Journal on Operations Research, 157(3):576-591, 2004.
9. T. Schiex, H. Fargier, and G. Verfaillie. Valued constraint satisfaction problems: hard and easy problems. In IJCAI-95, pages 631-637, 1995.