Manoel B. Campêlo

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