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

Authors:
Pham Quang Dung;Yves Deville;Pascal Van Hentenryck
Affiliations:
University of Louvain, Louvain-la-Neuve, Belgium;University of Louvain, Louvain-la-Neuve, Belgium;Brown University, Providence, RI
Venue:
Proceedings of the 2009 ACM symposium on Applied Computing
Year:
2009

Citing 10
Cited 3

A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Compression of correlated bit-vectors

Information Systems
Recursive star-tree parallel data structure

SIAM Journal on Computing
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

Journal of Heuristics
Lowest common ancestors in trees and directed acyclic graphs

Journal of Algorithms
Constraint-Based Local Search

Constraint-Based Local Search
Using Lagrangian dual information to generate degree constrained spanning trees

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

Proceedings of the 8th annual conference on Genetic and evolutionary computation
New metaheuristic approaches for the edge-weighted k-cardinality tree problem

Computers and Operations Research
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem

Operations Research Letters

Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering problem

Proceedings of the 2010 Symposium on Information and Communication Technology
Traffic engineering for multiple spanning tree protocol in large data centers

Proceedings of the 23rd International Teletraffic Congress
Constraint-Based local search for constrained optimum paths problems

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

LS(Graph & Tree) is a local search framework which aims at simplifying the modeling of Constraint Satisfaction Optimization Problems on graphs (CSOP on graphs or GCSOP). Optimum Constrained Trees (OCT) problems (a subclass of CSOP on graphs) in which we need to find an optimum subtree with additional constraints of a given weighted graph arise in many real-life applications. This paper introduces the LS(Graph & Tree) framework and local search abstractions for OCT problems. These abstractions are applied to model and solve the edge weighted k-Cardinality Tree (KCT) problem. The modeling as well as experimental results show the significance of the abstractions.