Manoel Campêlo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Manoel Campêlo has a total of 78 co-authors. Here are the top co-authors by number of shared publications:
- Ricardo Cordeiro Correa
Departamento de Computação Campus do Pici Universidade Federal do Ceará Bloco 910 60440-554 Fortaleza -CE Brazil
10 shared publications - Phablo F. S. Moura
Research Center for Operations Research & Statistics, KU Leuven, Leuven, Belgium
8 shared publications - Marcio Costa Santos
Grupo de Estudos em Otimização e Aprendizado de Máquinas (NEMO) Universidade fereral do Ceará – Campus Russas
5 shared publications - Daniel Severín
Depto. de Matemática (FCEIA) Universidad Nacional de Rosario Argentina
4 shared publications - Rudini Sampaio
Universidade Federal do Ceará
4 shared publications Susana Scheimberg
Universidade Federal do Rio de Janeiro—UFRJ
4 shared publications
Latest Publications
- Open Access
- 27 September 2026
- Published by Elsevier in SSRN Electronic Journal
Harmonious Colorings: bounds, heuristics and integer-linear formulations
A proper coloring $c$ of a simple graph $G$ is harmonious if, for every pair of distinct edges $uv,xy\in E(G)$, we have that $\{c(u),c(v)\}\neq \{c(x),c(y)\}$. The harmonious chromatic number of $G$, denoted by $h(G)$, is the least positive integer $k$ such that $G$ has a harmonious coloring with $k$ colors.In this work, we extend an idea presented in [Kolay, et al. Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comp. Sci. 772 (2019), 132–142] to compare the harmonious chromatic numbers of two graphs $G$ and $H$, with $H$ being obtained from $G$ by identifying vertices at distance at least three. Furthermore, by fixing a proof presented in the same work, we manage to improve one of its upper bounds.We also introduce and study the first, to the best of our knowledge, integer-linear programming formulations for this problem in the literature, along with some heuristics. We provide some preliminary tests on random instances and instances from the second DIMACS Implementation Challenge.- 27 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessHarmonious Colorings: bounds, heuristics and integer-linear formulations
A proper coloring $c$ of a simple graph $G$ is harmonious if, for every pair of distinct edges $uv,xy\in E(G)$, we have that $\{c(u),c(v)\}\neq \{c(x),c(y)\}$. The harmonious chromatic number of $G$, denoted by $h(G)$, is the least positive integer $k$ such that $G$ has a harmonious coloring with $k$ colors.In this work, we extend an idea presented in [Kolay, et al. Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comp. Sci. 772 (2019), 132–142] to compare the harmonious chromatic numbers of two graphs $G$ and $H$, with $H$ being obtained from $G$ by identifying vertices at distance at least three. Furthermore, by fixing a proof presented in the same work, we manage to improve one of its upper bounds.We also introduce and study the first, to the best of our knowledge, integer-linear programming formulations for this problem in the literature, along with some heuristics. We provide some preliminary tests on random instances and instances from the second DIMACS Implementation Challenge. - Open Access
- 20 July 2025
- Published by Sociedade Brasileira de Computação
- p. 65-69
Resultados de NP-dificuldade e Aproximação para o Problema da k−Floresta Geradora Minimamente Rotulada
Dado um grafo colorido em arestas G, o problema da k-floresta geradora minimamente rotulada consiste em encontrar uma floresta geradora F de G com número mínimo de cores e número de componentes limitado por k. Neste trabalho, apresentamos uma prova da NP-completude do problema em grafos split e propomos um algoritmo aproximativo para solucioná-lo.
- 20 July 2025
- Published by Sociedade Brasileira de Computação
- p. 65-69
Open AccessResultados de NP-dificuldade e Aproximação para o Problema da k−Floresta Geradora Minimamente Rotulada
Dado um grafo colorido em arestas G, o problema da k-floresta geradora minimamente rotulada consiste em encontrar uma floresta geradora F de G com número mínimo de cores e número de componentes limitado por k. Neste trabalho, apresentamos uma prova da NP-completude do problema em grafos split e propomos um algoritmo aproximativo para solucioná-lo.
- 29 August 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 314 (3) , 894-911
Integer programming models and polyhedral study for the geodesic classification problem on graphs
- 29 August 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 314 (3) , 894-911
Integer programming models and polyhedral study for the geodesic classification problem on graphs
- 1 December 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 323, 134-148
A compact quadratic model and linearizations for the minimum linear arrangement problem
- 1 December 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 323, 134-148
A compact quadratic model and linearizations for the minimum linear arrangement problem
- 20 April 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 316 (2) , 1573-1574
Correction to: Using the minimum maximum flow degree to approximate the flow coloring problem
- 20 April 2022
- Published by Springer Nature in Annals of Operations Research
- Vol. 316 (2) , 1573-1574
Correction to: Using the minimum maximum flow degree to approximate the flow coloring problem
- 10 February 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 303 (1) , 54-65
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
- 10 February 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 303 (1) , 54-65
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
- 1 October 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 301, 26-48
An integer programming approach for solving a generalized version of the Grundy domination number
- 1 October 2021
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 301, 26-48
An integer programming approach for solving a generalized version of the Grundy domination number
- 18 July 2021
- Published by Sociedade Brasileira de Computação
- p. 30-33
Conjunto de arcos de realimentação sob restrições de forçamento é FPT
O problema do conjunto de arcos de realimentação (FAS) consiste em encontrar um subconjunto de arcos de tamanho mínimo que contenha ao menos um elemento de cada circuito direcionado de um grafo direcionado. Estudamos o problema FAS sujeito a restrições de forçamento, as quais determinam que ao menos um elemento de certos pares de arcos deve estar presente em uma solução viável. Sabe-se que o problema de arcos de realimentação é FPT. Mostramos que o problema com restrições de forçamento também é FPT quando parametrizado pelo tamanho da solução.
- 18 July 2021
- Published by Sociedade Brasileira de Computação
- p. 30-33
Conjunto de arcos de realimentação sob restrições de forçamento é FPT
O problema do conjunto de arcos de realimentação (FAS) consiste em encontrar um subconjunto de arcos de tamanho mínimo que contenha ao menos um elemento de cada circuito direcionado de um grafo direcionado. Estudamos o problema FAS sujeito a restrições de forçamento, as quais determinam que ao menos um elemento de certos pares de arcos deve estar presente em uma solução viável. Sabe-se que o problema de arcos de realimentação é FPT. Mostramos que o problema com restrições de forçamento também é FPT quando parametrizado pelo tamanho da solução.
- 30 June 2021
- Published by Springer Nature in Annals of Operations Research
- Vol. 316 (2) , 1267-1278
Using the minimum maximum flow degree to approximate the flow coloring problem
- 30 June 2021
- Published by Springer Nature in Annals of Operations Research
- Vol. 316 (2) , 1267-1278
Using the minimum maximum flow degree to approximate the flow coloring problem
- 19 April 2021
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 42 (1) , 125-150
A unifying model for locally constrained spanning tree problems
- 19 April 2021
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 42 (1) , 125-150
A unifying model for locally constrained spanning tree problems