1 citations · 1 across the 6 of their papers we have counts for
11 papers
Convex Recoloring of General Graphs: Formulations, Polyhedra, and Computational Experiments
Boyue Lin, Phablo F. S. Moura, Roel Leus
A vertex coloring of a graph is convex if the vertices of each color induce a connected subgraph. In the convex recoloring problem (CR), the goal is to find a convex coloring while…
Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
Kobe Grobben, Phablo F. S. Moura, Hande Yaman
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knaps…
Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
Morteza Davari, Phablo F. S. Moura, Hande Yaman
The balanced connected -partition problem (\textsc{bcp}) is a classic problem, which consists in partitioning the set of vertices of a vertex-weighted connected graph into a col…
On the connected (sub)partition polytope
Phablo F. S. Moura, Hande Yaman, Roel Leus
Let be a positive integer and let be a graph with vertices. A connected -subpartition of is a collection of pairwise disjoint sets (a.k.a. classes) of vertic…
Compact formulations and valid inequalities for parallel machine scheduling with conflicts
Phablo F. S. Moura, Roel Leus, Hande Yaman
The problem of scheduling conflicting jobs on parallel machines consists in assigning a set of jobs to a set of machines so that no two conflicting jobs are allocated to the same m…
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…