Manoel B. Campêlo

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 27

Top Topics

Integer Program

Top Venues

Discret. Appl. Math.

Ann. Oper. Res.

Electron. Notes Discret. Math.

Publications

Paulo Henrique Macêdo de Araújo, Manoel B. Campêlo, Ricardo C. Corrêa, Martine Labbé
Integer programming models and polyhedral study for the geodesic classification problem on graphs. Eur. J. Oper. Res. 314 (3) (2024)
Paulo Henrique Macêdo de Araújo, Ricardo C. Corrêa, Manoel B. Campêlo
A parallel lagrangian heuristic for the fractional chromatic number of a graph. RAIRO Oper. Res. 57 (4) (2023)
Manoel B. Campêlo, Jhonata A. S. Matias
A strongly polynomial algorithm for the minimum maximum flow degree problem. Oper. Res. Lett. 51 (1) (2023)
Manoel B. Campêlo, Jhonata A. S. Matias
Using the minimum maximum flow degree to approximate the flow coloring problem. Ann. Oper. Res. 316 (2) (2022)
Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Joel C. Soares
Strong inequalities and a branch-and-price algorithm for the convex recoloring problem. Eur. J. Oper. Res. 303 (1) (2022)
Manoel B. Campêlo, Jhonata A. S. Matias
Correction to: Using the minimum maximum flow degree to approximate the flow coloring problem. Ann. Oper. Res. 316 (2) (2022)
Rafael Castro de Andrade, Tibérius de Oliveira e Bonates, Manoel B. Campêlo, Mardson da Silva Ferreira
A compact quadratic model and linearizations for the minimum linear arrangement problem. Discret. Appl. Math. 323 (2022)
Manoel B. Campêlo, Tatiane Fernandes Figueiredo
Integer programming approaches to the multiple team formation problem. Comput. Oper. Res. 133 (2021)
Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva
A unifying model for locally constrained spanning tree problems. J. Comb. Optim. 42 (1) (2021)
Manoel B. Campêlo, Daniel Severín
An integer programming approach for solving a generalized version of the Grundy domination number. Discret. Appl. Math. 301 (2021)
Manoel B. Campêlo, Joel C. Soares, Tarcisio F. Maciel, Francisco Rafael Marques Lima
Heuristics for the connected assignment problem in arrays. Int. Trans. Oper. Res. 28 (6) (2021)
Pablo Soares, Manoel B. Campêlo
t-Linearization for the maximum diversity problem. Optim. Lett. 15 (8) (2021)
Manoel B. Campêlo, Tatiane Fernandes Figueiredo, Ana Silva
The sociotechnical teams formation problem: a mathematical optimization approach. Ann. Oper. Res. 286 (1) (2020)
Luiz Alberto do Carmo Viana, Manoel B. Campêlo
Two dependency constrained spanning tree problems. Int. Trans. Oper. Res. 27 (2) (2020)
Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva
A Unifying Model for Locally Constrained Spanning Tree Problems. CoRR (2020)
Paulo Henrique Macêdo de Araújo, Manoel B. Campêlo, Ricardo C. Corrêa, Martine Labbé
The Geodesic Classification Problem on Graphs. LAGOS (2019)
Manoel B. Campêlo, Daniel Severín
An integer programming approach for solving a generalized version of the Grundy domination number. CoRR (2019)
Manoel B. Campêlo, Phablo F. S. Moura, Joel C. Soares
Polyhedral study of the Convex Recoloring problem. CoRR (2019)
Luiz Alberto do Carmo Viana, Manoel B. Campêlo
The Generalized Dependency Constrained Spanning Tree Problem. LAGOS (2019)
Manoel B. Campêlo, Daniel Severín
The polytope of legal sequences. CoRR (2018)
Manoel B. Campêlo, Thomas M. Liebling, Rudini Menezes Sampaio
Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015. Discret. Appl. Math. 245 (2018)
Manoel B. Campêlo, Daniel E. Severín
Facets of the polytope of legal sequences. Electron. Notes Discret. Math. 62 (2017)
Fabio C. S. Dias, Manoel B. Campêlo, Críston P. de Souza, Rafael Andrade
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: Complexity, properties and formulations. Comput. Oper. Res. 84 (2017)
Rafael Andrade, Tibérius O. Bonates, Manoel B. Campêlo, Mardson Ferreira
Minimum Linear Arrangements. Electron. Notes Discret. Math. 62 (2017)
Manoel B. Campêlo, Alexandre S. Freire, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi
The convex recoloring problem: polyhedra, facets and computational experiments. Math. Program. 156 (1-2) (2016)
Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos
Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope. Discret. Optim. 21 (2016)
Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Marcelo Mydlarz
A polyhedral study of the maximum stable set problem with weights on vertex-subsets. Discret. Appl. Math. 210 (2016)
Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi
Convex recoloring: inapproximability and a polyhedral study. CTW (2015)
Manoel B. Campêlo, Ricardo C. Corrêa, Cláudia Linhares Sales, Rudini M. Sampaio
Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium. Electron. Notes Discret. Math. 50 (2015)
Manoel B. Campêlo, Cristiana G. Huiban, Carlos Diego Rodrigues, Rudini M. Sampaio
On the complexity of the flow coloring problem. Discret. Appl. Math. 197 (2015)
Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos
Facet-defining inequalities for the representatives k-fold coloring polytope. CTW (2015)
Manoel B. Campêlo, Cristiana G. Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi
Hardness and inapproximability of convex recoloring problems. Theor. Comput. Sci. 533 (2014)
Manoel B. Campêlo, Cristiana G. Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi
On the Complexity of Solving or Approximating Convex Recoloring Problems. COCOON (2013)
Manoel B. Campêlo, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi
Polyhedral studies on the convex recoloring problem. Electron. Notes Discret. Math. 44 (2013)
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
Unique lifting of integer variables in minimal inequalities. Math. Program. 141 (1-2) (2013)
Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos
On the representatives k-fold coloring polytope. Electron. Notes Discret. Math. 44 (2013)
Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos
On optimal k-fold colorings of webs and antiwebs. Discret. Appl. Math. 161 (1-2) (2013)
Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos
Optimal k-fold colorings of webs and antiwebs CoRR (2011)
Álinson S. Xavier, Manoel B. Campêlo
A New Facet Generating Procedure for the Stable Set Polytope. Electron. Notes Discret. Math. 37 (2011)
Manoel B. Campêlo, Ricardo C. Corrêa
A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems. Electron. Notes Discret. Math. 36 (2010)
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
On Lifting Integer Variables in Minimal Inequalities. IPCO (2010)
Manoel B. Campêlo, Gérard Cornuéjols
Stable sets, corner polyhedra and the Chvátal closure. Oper. Res. Lett. 37 (6) (2009)
Manoel B. Campêlo, Ricardo C. Corrêa
A Lagrangian Relaxation for the Maximum Stable Set Problem CoRR (2009)
Manoel B. Campêlo, Gérard Cornuéjols
The Chvátal closure of generalized stable sets in bidirected graphs. Electron. Notes Discret. Math. 35 (2009)
Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa
On the asymmetric representatives formulation for the vertex coloring problem. Discret. Appl. Math. 156 (7) (2008)
Carlos Diego Rodrigues, Philippe Michelon, Manoel B. Campêlo
Recent Hybrid Techniques for the Multi-Knapsack Problem. CP (2008)
Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa
On the asymmetric representatives formulation for the vertex coloring problem. Electron. Notes Discret. Math. 19 (2005)
Manoel B. Campêlo, Susana Scheimberg
A Simplex Approach for Finding Local Solutions of a Linear Bilevel Program by Equilibrium Points. Ann. Oper. Res. 138 (1) (2005)
Manoel B. Campêlo, Ricardo C. Corrêa, Yuri Frota
Cliques, holes and the vertex coloring polytope. Inf. Process. Lett. 89 (4) (2004)
Carlos Henrique Medeiros de Sabóia, Manoel B. Campêlo, Susana Scheimberg
A Computational Study of Global Algorithms for Linear Bilevel Programming. Numer. Algorithms 35 (2-4) (2004)
Manoel B. Campêlo, Ricardo C. Corrêa, Nelson Maculan, Fábio Protti
ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors. Electron. Notes Discret. Math. 7 (2001)
Manoel B. Campêlo, Claudio T. Bornstein
Add/Drop Procedures for the Capacitated Plant Location Problem. Electron. Notes Discret. Math. 7 (2001)
Manoel B. Campêlo, Susana Scheimberg
A note on a modified simplex approach for solving bilevel linear programming problems. Eur. J. Oper. Res. 126 (2) (2000)
Manoel B. Campêlo, Simone Dantas, Susana Scheimberg
A Note on a Penalty Function Approach for Solving Bilevel Linear Programs. J. Glob. Optim. 16 (3) (2000)
Manoel B. Campêlo, Sulamita Klein
Maximum Vertex-weighted Matching in Strongly Chordal Graphs. Discret. Appl. Math. 84 (1-3) (1998)