Displaying similar documents to “Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.”

Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS

Mathieu Fontaine, Samir Loudni, Patrice Boizumault (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Tree decomposition introduced by Robertson and Seymour aims to decompose a problem into clusters constituting an acyclic graph. There are works exploiting tree decomposition for complete search methods. In this paper, we show how tree decomposition can be used to efficiently guide local search methods that use large neighborhoods like VNS. We propose DGVNS (Decomposition Guided VNS) which uses the graph of clusters in order to build neighborhood structures enabling better diversification...

The triangles method to build X -trees from incomplete distance matrices

Alain Guénoche, Bruno Leclerc (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A method to infer X -trees (valued trees having X as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2 n -3 distance values between the n elements of X , if they fulfill some explicit conditions. This construction is based on the mapping between X -tree and a weighted generalized 2-tree spanning X .

The color-balanced spanning tree problem

Štefan Berežný, Vladimír Lacko (2005)

Kybernetika

Similarity:

Suppose a graph G = ( V , E ) whose edges are partitioned into p disjoint categories (colors) is given. In the color-balanced spanning tree problem a spanning tree is looked for that minimizes the variability in the number of edges from different categories. We show that polynomiality of this problem depends on the number p of categories and present some polynomial algorithm.