Phillippe Samer

activity

20132023

most citedA branch and cut algorithm for minimum spanning trees under conflict constraints

42 citations · 59 across the 6 of their papers we have counts for

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2023

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…

cs.DM2022★ 4 cited

Polyhedral results and stronger Lagrangean bounds for stable spanning trees

Phillippe Samer, Dag Haugland

Given a graph $G = (V, E)$ and a set $C$ of unordered pairs of edges regarded as being in conflict, a stable spanning tree in $G$ is a set of edges $T$ inducing a spanning tree in $G$ …

cs.DM2015★ 11 cited

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 $G = (V, E)$ , the minimum branch vertices problem consists in finding a spanning tree $T = (V, E^{'})$ of $G$ minimizing the number of vertices with degree greater than two. W…