Cooperative parallel decomposition guided VNS for solving weighted csp

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

Volumn 8457 LNCS, Issue , 2014, Pages 100-114

  Ouali, Abdelkader ^a   Loudni, Samir ^b   Loukil, Lakhdar ^a   Boizumault, Patrice ^b   Lebbah, Yahia ^a  

^a UNIVERSITY OF ORAN   (Algeria)

^b UNIVERSITÉ DE CAEN   (France)

Author keywords

Master Slave architecture; Meta heuristics; Parallelization; Tree decomposition; Variable Neighborhood Search (VNS); Weighted CSP

Indexed keywords

FORESTRY; HEURISTIC ALGORITHMS; OPTIMIZATION;

MASTER-SLAVE ARCHITECTURE; META HEURISTICS; PARALLELIZATIONS; TREE DECOMPOSITION; VARIABLE NEIGHBORHOOD SEARCH; WEIGHTED CSP;

TREES (MATHEMATICS);

ALGORITHMS; FORESTRY; MATHEMATICS; OPTIMIZATION; TREES;

EID: 84903554863     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-07644-7_8     Document Type: Conference Paper

References (20)

1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-Tree. SIAM Journal on Algebraic and Discrete Methods 8, 277-284 (1987)
2. Bensana, E., Lemâitre, M., Verfaillie, G.: Earth observation satellite management. Constraints 4(3), 293-299 (1999)
3. Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio link frequency assignment. Constraints 4(1), 79-89 (1999)
4. Crainic, T.G., Gendreau, M., Hansen, P., Mladenovic, N.: Cooperative parallel variable neighborhood search for the p-median. Journal of Heuristics 10(3), 293-314 (2004)
5. de Givry, S., Schiex, T., Verfaillie, G.: Exploiting tree decomposition and soft local consistency in weighted csp. In: AAAI, pp. 22-27. AAAI Press (2006)
6. Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence 38(3), 353-366 (1989)
7. Carlson, C.S., et al.: Selecting a maximally informative set of single-nucleotide polymorphisms for association analyses using linkage disequilibrium. American Journal of Human Genetics 74(1), 106-120 (2004)
8. Fontaine, M., Loudni, S., Boizumault, P.: Exploiting tree decomposition for guiding neighborhoods exploration for VNS. RAIRO Operations Research 47(2), 91-123 (2013)
9. Gottlob, G., Lee, S.T., Valiant, G.: Size and treewidth bounds for conjunctive queries. In: Paredaens, J., Su, J. (eds.) PODS, pp. 45-54. ACM (2009)
10. Harvey,W.D., Ginsberg, M.L.: Limited discrepancy search. In: IJCAI, pp. 607-615. Morgan Kaufmann (1995)
11. Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for Weighted CSP. In: IJCAI, pp. 239-244 (2003)
12. Loudni, S., Boizumault, P.: Combining VNS with constraint programming for solving anytime optimization problems. European Journal of Operational Research 191, 705-735 (2008)
13. Marinescu, R., Dechter, R.: AND/OR branch-And-bound search for combinatorial optimization in graphical models. Artificial Intelligence 173(16-17), 1457-1491 (2009)
14. Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097-1100 (1997)
15. Pearl, J.: Probabilistic inference in intelligent systems. In: Networks of Plausible Inference. Morgan Kaufmann (1998)
16. Rish, I., Dechter, R.: Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning 24(1/2), 225-275 (2000)
17. Robertson, N., Seymour, P.D.: Graph minors. ii. algorithmic aspects of tree-width. Journal of Algorithms 7(3), 309-322 (1986)
18. Sanchez, M., Allouche, D., de Givry, S., Schiex, T.: Russian doll search with tree decomposition. In: Boutilier, C. (ed.) IJCAI, pp. 603-608 (2009)
19. Sanchez, M., de Givry, S., Schiex, T.: Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints 13(1-2), 130-154 (2008)
20. Tarjan, R.E., Yannakakis, M.: Simple linear-Time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing 13(3), 566-579 (1984)