Guiding VNS with tree decomposition

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2011, Pages 505-512

  Fontaine, Mathieu ^a,b   Loudni, Samir ^a,b   Boizumault, Patrice ^a,b  

^a UNIVERSITÉ DE CAEN   (France)

^b Centre National de la Recherche Scientifique   (France)

Author keywords

Constraint programming; Tree decomposition; VNS

Indexed keywords

ACYCLIC GRAPHS; COMPLETE SEARCH; CONSTRAINT PROGRAMMING; LARGE NEIGHBORHOOD; LOCAL SEARCH METHOD; RANDOM INSTANCE; TREE DECOMPOSITION; VNS;

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORESTRY;

TREES (MATHEMATICS);

FORESTRY; MATHEMATICS; TREES;

EID: 84855806043     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2011.82     Document Type: Conference Paper

References (19)

1. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM. J. on Algebraic and Discrete Methods, 8:277-284, 1987.
2. E. Bensana, M. Lemaître, and G. Verfaillie. Earth observation satellite management. Constraints, 4(3):293-299, 1999. (Pubitemid 129579728)
3. B. Cabon, S. de Givry, L. Lobjois, T. Schiex, and J.P. Warners. Radio link frequency assignment. Constraints, 4(1):79-89, 1999. (Pubitemid 129583417)
4. S. de Givry. Rapport de hdr, INRA UBIA Toulouse. 2011.
5. S. de Givry, T. Schiex, and G. Verfaillie. Exploiting tree decomposition and soft local consistency in weighted csp. In AAAI-06.
6. P. Hansen, N. Mladenovic, and D. Perez-Brito. Variable neighborhood decomposition search. Journal of Heuristics, 7(4):335-350, 2001. (Pubitemid 32693910)
7. W. D. Harvey and M. L. Ginsberg. Limited discrepancy search. In IJCAI'95, pages 607-615, 1995.
8. P. Jégou, S. Ndiaye, and C. Terrioux. Computing and exploiting tree-decompositions for solving constraint networks. In CP, pages 777-781, 2005.
9. M. Kitching and F. Bacchus. Exploiting decomposition on constraint problems with high tree-width. In IJCAI, pages 525-531, 2009.
10. J. Larrosa and T. Schiex. In the quest of the best form of local consistency for weighted CSP. In IJCAI, pages 239-244, 2003.
11. S. Loudni and P. Boizumault. Combining VNS with constraint programming for solving anytime optimization problems. EJOR, 191:705-735, 2008. (Pubitemid 351778611)
12. R. Marinescu and R. Dechter. AND/OR branch-and-bound search for combinatorial optimization in graphical models. Artif. Intell., 173(16-17):1457-1491, 2009.
13. N. Mladenovic and P. Hansen. Variable neighborhood search. Computers And Operations Research, 24:1097-1100, 1997.
14. B. Neveu, G. Trombettoni, and F. Glover. ID Walk: A candidate list strategy with a simple diversification device. In CP'04, LNCS 3258, pages 423-437, 2004.
15. N. Robertson and P.D. Seymour. Graph minors. ii. algorithmic aspects of tree-width. J. Algorithms, 7(3):309-322, 1986.
16. M. Sánchez, D. Allouche, S. de Givry, and T. Schiex. Russian doll search with tree decomposition. In IJCAI, pages 603-608, 2009.
17. P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In CP-98.
18. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hyper-graphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13(3):566-579, 1984. (Pubitemid 15514404)
19. H. van Benthem. Graph: Generating radiolink frequency assignment problems heuristically, 1995.