منابع مشابه
The min-cut and vertex separator problem
We consider graph three-partitions with the objective of minimizing the number of edges between the first two partition sets while keeping the size of the third block small. We review most of the existing relaxations for this min-cut problem and focus on a new class of semidefinite relaxations, based on matrices of order 2n+ 1 which provide a good compromise between quality of the bound and com...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملThe cut separator problem
Given G = (V, E) an undirected graph and two speci ed nonadjacent nodes a and b of V , a cut separator is a subset F = δ(C) ⊆ E such that a, b ∈ V \C and a and b belong to di erent connected components of the graph induced by V \C. Given a nonnegative cost vector c ∈ R|E| + , the optimal cut separator problem is to nd a cut separator of minimum cost. This new problem is closely related to the v...
متن کاملThe Multi-terminal Vertex Separator Problem: Polyhedral Analysis and Branch-and- Cut
Let G = (V ∪ T, E) be an undirected graph such that V is a set of vertices, E a set of edges and T a set of terminal vertices. The Multi-terminal vertex separator problem consists in partitioning V into k + 1 subsets {S, V1,..., Vk} minimizing the size of S and such that there is no edge between two subsets Vi and Vj and each subset Vi contains exactly one terminal. Set S is called a separator....
متن کاملPath relinking for the vertex separator problem
This paper presents the first population-based path relinking algorithm for solving the NP-hard vertex separator problem in graphs. The proposed algorithm employs a dedicated relinking procedure to generate intermediate solutions between an initiating solution and a guiding solution taken from a reference set of elite solutions (population) and uses a fast tabu search procedure to improve some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2017
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-017-9943-4