42 citations · 59 across the 6 of their papers we have counts for
6 papers
On a class of strong valid inequalities for the connected matching polytope
Phillippe Samer
We identify a family of nontrivial facets of the connected matching polytope of a graph , that is, the convex hull of incidence vectors of matchings in whose c…
Polyhedral approach to weighted connected matchings in general graphs
Phillippe Samer, Phablo F. S. Moura
A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximu…
Polyhedral results and stronger Lagrangean bounds for stable spanning trees
Phillippe Samer, Dag Haugland
Given a graph and a set of unordered pairs of edges regarded as being in conflict, a stable spanning tree in is a set of edges inducing a spanning tree in …
The matching relaxation for a class of generalized set partitioning problems
Phillippe Samer, Evellyn Cavalcante, Sebastián Urrutia +1
This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints.…
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
Rafael A. Melo, Phillippe Samer, Sebastián Urrutia
Given a graph , the minimum branch vertices problem consists in finding a spanning tree of minimizing the number of vertices with degree greater than two. W…
A branch and cut algorithm for minimum spanning trees under conflict constraints
Phillippe Samer, Sebastián Urrutia
We study approaches for the exact solution of the \NP--hard minimum spanning tree problem under conflict constraints. Given a graph and a set of con…