24 citations · 37 across the 7 of their papers we have counts for
8 papers
Harmonious Colorings: bounds, heuristics and integer-linear formulations
Júlio Araújo, Manoel Campêlo, Beatriz Martins +1
A proper coloring of a simple graph is harmonious if, for every pair of distinct edges , we have that . The harmonious chrom…
A Unifying Model for Locally Constrained Spanning Tree Problems
Luiz Alberto do Carmo Viana, Manoel Campêlo, Ignasi Sau +1
Given a graph and a digraph whose vertices are the edges of , we investigate the problem of finding a spanning tree of that satisfies the constraints imposed by .…
An integer programming approach for solving a generalized version of the Grundy domination number
Manoel Campêlo, Daniel Severín
A sequence of vertices in a graph is called a legal dominating sequence if every vertex in the sequence dominates at least one vertex not dominated by those that precede it, and at…
Polyhedral study of the Convex Recoloring problem
Manoel Campêlo, Phablo F. S. Moura, Joel C. Soares
A coloring of the vertices of a connected graph is convex if each color class induces a connected subgraph. We address the convex recoloring (CR) problem defined as follows. Given…
The polytope of legal sequences
Manoel Campêlo, Daniel Severín
A sequence of vertices in a graph is called a \emph{(total) legal dominating sequence} if every vertex in the sequence (total) dominates at least one vertex not dominated by those…
Unique lifting of integer variables in minimal inequalities
Amitabh Basu, Manoel Campelo, Michele Conforti +2
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tabl…
Optimal k-fold colorings of webs and antiwebs
Manoel Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura +1
A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1, 2, ..., x} to each vertex such that any two adjacent vertices are assigned disjoint…
A Lagrangian Relaxation for the Maximum Stable Set Problem
Manoel Campelo, Ricardo C. Correa
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exa…