Manoel B. Campêlo

According to our database, Manoel B. Campêlo authored at least 51 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

A parallel lagrangian heuristic for the fractional chromatic number of a graph.

Paulo Henrique Macêdo de Araújo, Ricardo C. Corrêa, Manoel B. Campêlo

RAIRO Oper. Res., July, 2023

A strongly polynomial algorithm for the minimum maximum flow degree problem.

Manoel B. Campêlo, Jhonata A. S. Matias

Oper. Res. Lett., January, 2023

2022

Strong inequalities and a branch-and-price algorithm for the convex recoloring problem.

Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Joel C. Soares

Eur. J. Oper. Res., 2022

A compact quadratic model and linearizations for the minimum linear arrangement problem.

Rafael Castro de Andrade, Tibérius de Oliveira e Bonates, Manoel B. Campêlo, Mardson da Silva Ferreira

Discret. Appl. Math., 2022

Correction to: Using the minimum maximum flow degree to approximate the flow coloring problem.

Manoel B. Campêlo, Jhonata A. S. Matias

Ann. Oper. Res., 2022

Using the minimum maximum flow degree to approximate the flow coloring problem.

Manoel B. Campêlo, Jhonata A. S. Matias

Ann. Oper. Res., 2022

2021

t-Linearization for the maximum diversity problem.

Pablo Soares, Manoel B. Campêlo

Optim. Lett., 2021

A unifying model for locally constrained spanning tree problems.

Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva

J. Comb. Optim., 2021

Heuristics for the connected assignment problem in arrays.

Manoel B. Campêlo, Joel C. Soares, Tarcisio F. Maciel, Francisco Rafael Marques Lima

Int. Trans. Oper. Res., 2021

An integer programming approach for solving a generalized version of the Grundy domination number.

Manoel B. Campêlo, Daniel Severín

Discret. Appl. Math., 2021

Integer programming approaches to the multiple team formation problem.

Manoel B. Campêlo, Tatiane Fernandes Figueiredo

Comput. Oper. Res., 2021

2020

Two dependency constrained spanning tree problems.

Luiz Alberto do Carmo Viana, Manoel B. Campêlo

Int. Trans. Oper. Res., 2020

The sociotechnical teams formation problem: a mathematical optimization approach.

Manoel B. Campêlo, Tatiane Fernandes Figueiredo, Ana Silva

Ann. Oper. Res., 2020

2019

The Generalized Dependency Constrained Spanning Tree Problem.

Luiz Alberto do Carmo Viana, Manoel B. Campêlo

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

The Geodesic Classification Problem on Graphs.

Paulo Henrique Macêdo de Araújo, Manoel B. Campêlo, Ricardo C. Corrêa, Martine Labbé

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Polyhedral study of the Convex Recoloring problem.

Manoel B. Campêlo, Phablo F. S. Moura, Joel C. Soares

CoRR, 2019

2018

Preface: LAGOS'15 - Eighth Latin-American Algorithms, Graphs, and Optimization Symposium, Fortaleza, Brazil - 2015.

Manoel B. Campêlo, Thomas M. Liebling, Rudini Menezes Sampaio

Discret. Appl. Math., 2018

The polytope of legal sequences.

Manoel B. Campêlo, Daniel Severín

CoRR, 2018

2017

Facets of the polytope of legal sequences.

Manoel B. Campêlo, Daniel E. Severín

Electron. Notes Discret. Math., 2017

Minimum Linear Arrangements.

Rafael Andrade, Tibérius O. Bonates, Manoel B. Campêlo, Mardson Ferreira

Electron. Notes Discret. Math., 2017

Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: Complexity, properties and formulations.

Fabio C. S. Dias, Manoel B. Campêlo, Críston P. de Souza, Rafael Andrade

Comput. Oper. Res., 2017

2016

The convex recoloring problem: polyhedra, facets and computational experiments.

Manoel B. Campêlo, Alexandre S. Freire, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi

Math. Program., 2016

Lifted, projected and subgraph-induced inequalities for the representatives k-fold coloring polytope.

Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos

Discret. Optim., 2016

A polyhedral study of the maximum stable set problem with weights on vertex-subsets.

Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Marcelo Mydlarz

Discret. Appl. Math., 2016

2015

Preface - VIII Latin-american Algorithms, Graphs and Optimization Symposium.

Manoel B. Campêlo, Ricardo C. Corrêa, Cláudia Linhares Sales, Rudini M. Sampaio

Electron. Notes Discret. Math., 2015

On the complexity of the flow coloring problem.

Manoel B. Campêlo, Cristiana Gomes Huiban, Carlos Diego Rodrigues, Rudini M. Sampaio

Discret. Appl. Math., 2015

Facet-defining inequalities for the representatives k-fold coloring polytope.

Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Convex recoloring: inapproximability and a polyhedral study.

Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Hardness and inapproximability of convex recoloring problems.

Manoel B. Campêlo, Cristiana Gomes Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi

Theor. Comput. Sci., 2014

2013

Unique lifting of integer variables in minimal inequalities.

Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

Math. Program., 2013

On the representatives k-fold coloring polytope.

Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos

Electron. Notes Discret. Math., 2013

Polyhedral studies on the convex recoloring problem.

Manoel B. Campêlo, Karla Roberta Lima, Phablo F. S. Moura, Yoshiko Wakabayashi

Electron. Notes Discret. Math., 2013

On optimal k-fold colorings of webs and antiwebs.

Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos

Discret. Appl. Math., 2013

On the Complexity of Solving or Approximating Convex Recoloring Problems.

Manoel B. Campêlo, Cristiana Gomes Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Power allocation schemes for multichannel two-hop relaying systems.

Jose Mairton B. da Silva Jr., Yuri C. B. Silva, Tarcisio F. Maciel, Francisco Rodrigo P. Cavalcanti, Carlos Diego Rodrigues, Manoel Bezerra Campêlo Neto

Proceedings of the 2012 International Symposium on Wireless Communication Systems (ISWCS), 2012

2011

A New Facet Generating Procedure for the Stable Set Polytope.

Álinson S. Xavier, Manoel B. Campêlo

Electron. Notes Discret. Math., 2011

2010

A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems.

Manoel B. Campêlo, Ricardo C. Corrêa

Electron. Notes Discret. Math., 2010

On Lifting Integer Variables in Minimal Inequalities.

Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Stable sets, corner polyhedra and the Chvátal closure.

Manoel B. Campêlo, Gérard Cornuéjols

Oper. Res. Lett., 2009

The Chvátal closure of generalized stable sets in bidirected graphs.

Manoel B. Campêlo, Gérard Cornuéjols

Electron. Notes Discret. Math., 2009

A Lagrangian Relaxation for the Maximum Stable Set Problem

Manoel B. Campêlo, Ricardo C. Corrêa

CoRR, 2009

2008

Recent Hybrid Techniques for the Multi-Knapsack Problem.

Carlos Diego Rodrigues, Philippe Michelon, Manoel B. Campêlo

Proceedings of the Principles and Practice of Constraint Programming, 2008

2005

On the asymmetric representatives formulation for the vertex coloring problem.

Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa

Electron. Notes Discret. Math., 2005

A Simplex Approach for Finding Local Solutions of a Linear Bilevel Program by Equilibrium Points.

Manoel B. Campêlo, Susana Scheimberg

Ann. Oper. Res., 2005

2004

A Computational Study of Global Algorithms for Linear Bilevel Programming.

Carlos Henrique Medeiros de Sabóia, Manoel B. Campêlo, Susana Scheimberg

Numer. Algorithms, 2004

Cliques, holes and the vertex coloring polytope.

Manoel B. Campêlo, Ricardo C. Corrêa, Yuri Frota

Inf. Process. Lett., 2004

2001

ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors.

Manoel B. Campêlo, Ricardo C. Corrêa, Nelson Maculan, Fábio Protti

Electron. Notes Discret. Math., 2001

Add/Drop Procedures for the Capacitated Plant Location Problem.

Manoel B. Campêlo, Claudio T. Bornstein

Electron. Notes Discret. Math., 2001

2000

A Note on a Penalty Function Approach for Solving Bilevel Linear Programs.

Manoel B. Campêlo, Simone Dantas, Susana Scheimberg

J. Glob. Optim., 2000

A note on a modified simplex approach for solving bilevel linear programming problems.

Manoel B. Campêlo, Susana Scheimberg

Eur. J. Oper. Res., 2000

1998

Maximum Vertex-weighted Matching in Strongly Chordal Graphs.

Manoel B. Campêlo, Sulamita Klein

Discret. Appl. Math., 1998