LS(graph & tree): A local search framework for constraint optimization on graphs and trees

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 1402-1407

  Dung, Pham Quang ^a   Deville, Yves ^a   Van Hentenryck, Pascal ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b BROWN UNIVERSITY   (United States)

Author keywords

Constrained tree problems; Constraint optimization; Graph theory; KCT; Local search

Indexed keywords

CARDINALITIES; CONSTRAINED TREE PROBLEMS; CONSTRAINT OPTIMIZATIONS; CONSTRAINT SATISFACTION; LOCAL SEARCH; OPTIMIZATION PROBLEMS; REAL-LIFE APPLICATIONS; SUBTREES; WEIGHTED GRAPH;

ABSTRACTING; COMPUTER SCIENCE; CONSTRAINED OPTIMIZATION;

GRAPH THEORY;

EID: 72949093745     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529595     Document Type: Conference Paper

References (20)

1. R. K. Ahujaa, J. B. Orlinb, and D. Sharma. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research Letters 31, pages 185-194, 2003.
2. R. Andrade, A. Lucena, and N. Maculan. Using lagrangian dual information to generate degree constrained spanning trees. Discrete Applied Mathematics, pages 703-717, 2006.
3. M. A. Bender, M. Farach-Colton, G. Pemmasani, S. Skiena, and P. Sumazin. Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms 57, pages 75-94, 2005.
4. O. Berkman and U. Vishkin. Recursive star-tree parallel data structure. SIAM J. Comput., 22(2):221-242, 1993.
5. C. Blum and M. Blesa. New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers and Operations Research, pages 32(6):1355-1377, 2005.
6. A. Bookstein and S. T. Klein. Compression of correlated bit-vectors. Information Systems, 16(4):387-400, 1991.
7. M. Chimani, M. Kandyba, I. Ljubic, and P. Mutzel. Obtaining optimal k-cardinality trees fast. 10th Workshop on Algorithm Engineering and Experiments 2008, San Francisco (ALENEX08), SIAM, pages 27-36, 2008.
8. M. de Aragão, E. Uchoa, and R. Werneck. Dual heuristics on the exact solution of large Steiner problems. In Proceedings of the Brazilian Symposium on Graphs, Algorithms and Combinatorics GRACO'01, Fortaleza, 2001.
9. G. Dooms, Y. Deville, and P. Dupont. Cp(graph): Introducing a graph computation domain in constraint programming. International Conference on Principles and Practice on Constraint Programming, LNCS 3709, pages 211-225, 2005.
10. T. Fischer. Improved local search for large optimum communication spanning tree problems. In MIC'2007 - 7th Metaheuristics International Conference, 2007.
11. M. Gomes, R. Andrade, C. Santiago, and N. Maculan. Spanning tree algorithms to some hard combinatorial problems. in : Proceedings of Optimization Days, Montreal/Canada, pages 83-84, 1997.
12. M. Gruber, J. van Hemert, and G. Raidl. Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a vns, ea, and aco. Proceedings of the Genetic and Evolutionary Computation Conference, pages 1187-1194, 2006.
13. P. V. Hentenrych and L. Michel. Constraint-based local search. The MIT Press, London, England, 2005.
14. P. V. Hentenryck, L. Michel, and L. Liu. Constraint-based combinators for local search. International Conference on Constraint Programming, LNCS 3258, pages 47-61, 2004.
15. KCTLib. http://iridia.ulb.ac.be/ cblum/kctlib/, 2003.
16. M. Krishnamoorthy, A. T. Ernst, and Y. M. Sharaiha. Comparison of algorithms for the degree constrained minimum spanning tree. Journal of Heuristics, pages 587-611, 2001.
17. E. Nardelli and G. Proietti. Finding all the best swaps of a minimum diameter spanning tree under transient edge failures. Journal of Graph Algorithms and Applications vol. 5, no. 5, pages 39-57, 2001.
18. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst., 7(1):61-77, 1989.
19. M. Reimann and M. Laumanns. A hybrid aco algorithm for the capacitated minimum spanning tree problem. Proceedings of First International Workshop on Hybrid Metaheuristics, pages 1-10, 2004.
20. M. Zachariasen. Local Search for the Steiner Tree Problem in the Euclidean Plane. European Journal of Operational Research, 119:282-300, 1999.