Personal information

Websites & social links

Curriculum

Other IDs

ResearcherID: C-8078-2013
Scopus Author ID: 6602748281

Keywords

mathematical optimization, integer programming, combinatorial optimization

Countries

Brazil

Activities

Collapse all

Employment (1)

Universidade Federal do Ceará: Fortaleza, CE, BR

1992-09-22 to present | Full Professor (Statistics and Applied Mathematics Department)
Employment
Source: Self-asserted source
Manoel Campêlo

Education and qualifications (2)

Universidade Federal do Rio de Janeiro: Rio de Janeiro, RJ, BR

1999-09-15 to 1999-12-19 | Doctor in Science in Optimization (Systems Engeneering and Computing)
Education
Source: Self-asserted source
Manoel Campêlo

Universidade Federal do Rio de Janeiro: Rio de Janeiro, RJ, BR

1991-03-01 to 1993-08-19 | Master in Science in Optimization (Systems Engeneering and Computing)
Education
Source: Self-asserted source
Manoel Campêlo

Professional activities (1)

Carnegie Mellon University: Pittsburgh, PA, US

2008-08-01 to 2009-07-31 | Visiting Scholar (Tepper School of Business)
Invited position
Source: Self-asserted source
Manoel Campêlo

Works (49)

Integer programming models and polyhedral study for the geodesic classification problem on graphs

European Journal of Operational Research
2024-05 | Journal article
DOI: 10.1016/j.ejor.2023.08.029
Contributors: Paulo H. M. Araújo; Manoel Campêlo; Ricardo C. Corrêa; Martine Labbé
Source: check_circle
Crossref

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

Discrete Applied Mathematics
2022-12 | Journal article
DOI: 10.1016/j.dam.2021.06.021
Contributors: Rafael Castro de Andrade; Tibérius de Oliveira e Bonates; Manoel Campêlo; Mardson da Silva Ferreira
Source: check_circle
Crossref

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

European Journal of Operational Research
2022-11 | Journal article
DOI: 10.1016/j.ejor.2022.02.013
Contributors: Manoel Campêlo; Alexandre S. Freire; Phablo F.S. Moura; Joel C. Soares
Source: check_circle
Crossref

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

Annals of Operations Research
2022-09 | Journal article
DOI: 10.1007/s10479-022-04555-0
Contributors: Manoel Campêlo; Jhonata A. S. Matias
Source: check_circle
Crossref

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

Annals of Operations Research
2022-09 | Journal article
DOI: 10.1007/s10479-021-04180-3
Contributors: Manoel Campêlo; Jhonata A. S. Matias
Source: check_circle
Crossref

Heuristics for the connected assignment problem in arrays

International Transactions in Operational Research
2021-11 | Journal article
DOI: 10.1111/itor.12706
Contributors: Manoel Campêlo; Joel C. Soares; Tarcisio F. Maciel; F. Rafael M. Lima
Source: check_circle
Crossref

t-Linearization for the maximum diversity problem

Optimization Letters
2021-11-09 | Journal article
DOI: 10.1007/s11590-021-01719-y
Contributors: Pablo Soares; Manoel Campêlo
Source: check_circle
Crossref

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

Discrete Applied Mathematics
2021-10 | Journal article
DOI: 10.1016/j.dam.2021.05.025
Contributors: Manoel Campêlo; Daniel Severín
Source: check_circle
Crossref

A unifying model for locally constrained spanning tree problems

Journal of Combinatorial Optimization
2021-07-19 | Journal article
DOI: 10.1007/s10878-021-00740-2
Contributors: Luiz Viana; Manoel Campêlo; Ignasi Sau; Ana Silva
Source: check_circle
Crossref

Conjunto de arcos de realimentação sob restrições de forçamento é FPT

2021-07-18 | Conference paper
DOI: 10.5753/etc.2021.16373
Contributors: Leonardo C. de Abreu; Manoel Campêlo; Ana Karolinna Maia
Source: check_circle
Crossref

Propriedades do Problema da Floresta Geradora k-Rotulada

2020-06-30 | Conference paper
DOI: 10.5753/etc.2020.11092
Contributors: Pedro Jorge De Abreu Figueredo; Manoel Campêlo
Source: check_circle
Crossref

Two dependency constrained spanning tree problems

International Transactions in Operational Research
2020-03 | Journal article
DOI: 10.1111/itor.12690
Contributors: Luiz Alberto do Carmo Viana; Manoel Campêlo
Source: check_circle
Crossref

The Generalized Dependency Constrained Spanning Tree Problem

Electronic Notes in Theoretical Computer Science
2019-08 | Journal article
DOI: 10.1016/j.entcs.2019.08.062
Part of ISSN: 1571-0661
Source: Self-asserted source
Manoel Campêlo

The Geodesic Classification Problem on Graphs

Electronic Notes in Theoretical Computer Science
2019-08 | Journal article
DOI: 10.1016/j.entcs.2019.08.007
Part of ISSN: 1571-0661
Source: Self-asserted source
Manoel Campêlo

The sociotechnical teams formation problem: a mathematical optimization approach

Annals of Operations Research
2018-01-12 | Journal article
DOI: 10.1007/s10479-018-2759-5
Part of ISSN: 0254-5330
Part of ISSN: 1572-9338
Source: Self-asserted source
Manoel Campêlo

Facets of the polytope of legal sequences

Electronic Notes in Discrete Mathematics
2017-11 | Journal article
DOI: 10.1016/j.endm.2017.10.004
Part of ISSN: 1571-0653
Source: Self-asserted source
Manoel Campêlo

Minimum Linear Arrangements

Electronic Notes in Discrete Mathematics
2017-11 | Journal article
DOI: 10.1016/j.endm.2017.10.012
Part of ISSN: 1571-0653
Source: Self-asserted source
Manoel Campêlo

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

Computers & Operations Research
2017-08 | Journal article
DOI: 10.1016/j.cor.2017.03.001
Part of ISSN: 0305-0548
Source: Self-asserted source
Manoel Campêlo

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

Discrete Applied Mathematics
2016 | Journal article
DOI: 10.1016/j.dam.2015.05.032
EID:

2-s2.0-84933574430
Contributors: Campêlo, M.; Campos, V.A.; Corrêa, R.C.; Donne, D.D.; Marenco, J.; Mydlarz, M.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

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

Discrete Optimization
2016 | Journal article
DOI: 10.1016/j.disopt.2016.06.003
EID:

2-s2.0-84978747041
Contributors: Campêlo, M.; Moura, P.F.S.; Santos, M.C.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

The convex recoloring problem: polyhedra, facets and computational experiments

Mathematical Programming
2016 | Journal article
DOI: 10.1007/s10107-015-0880-7
EID:

2-s2.0-84958115168
Contributors: Campêlo, M.; Freire, A.S.; Lima, K.R.; Moura, P.F.S.; Wakabayashi, Y.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

On the complexity of the flow coloring problem

Discrete Applied Mathematics
2015 | Journal article
DOI: 10.1016/j.dam.2015.06.025
EID:

2-s2.0-84941961456
Contributors: Campêlo, M.; Huiban, C.; Rodrigues, C.D.; Sampaio, R.M.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

Hardness and inapproximability of convex recoloring problems

Theoretical Computer Science
2014-05 | Journal article
DOI: 10.1016/j.tcs.2014.03.017
Contributors: Manoel Campêlo; Cristiana Huiban; Rudini M. Sampaio; Yoshiko Wakabayashi
Source: Self-asserted source
Manoel Campêlo via Crossref Metadata Search

On optimal k-fold colorings of webs and antiwebs

Discrete Applied Mathematics
2013 | Journal article
DOI: 10.1016/j.dam.2012.07.013
EID:

2-s2.0-84869085487
Contributors: Campêlo, M.; Corrêa, R.C.; Moura, P.F.S.; Santos, M.C.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier
grade
Preferred source (of 2)‎

On the complexity of solving or approximating convex recoloring problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013 | Book
DOI: 10.1007/978-3-642-38768-5_54
EID:

2-s2.0-84884944659
Contributors: Campêlo, M.B.; Huiban, C.G.; Sampaio, R.M.; Wakabayashi, Y.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

On the representatives k-fold coloring polytope

Electronic Notes in Discrete Mathematics
2013 | Journal article
DOI: 10.1016/j.endm.2013.10.037
EID:

2-s2.0-84887150116
Contributors: Campêlo, M.; Moura, P.F.S.; Santos, M.C.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

Polyhedral studies on the convex recoloring problem

Electronic Notes in Discrete Mathematics
2013 | Journal article
DOI: 10.1016/j.endm.2013.10.036
EID:

2-s2.0-84887142660
Contributors: Campêlo, M.; Lima, K.R.; Moura, P.F.S.; Wakabayashi, Y.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

Unique lifting of integer variables in minimal inequalities

Mathematical Programming
2013 | Journal article
DOI: 10.1007/s10107-012-0560-9
EID:

2-s2.0-84884671470
Contributors: Basu, A.; Campêlo, M.; Conforti, M.; Cornuéjols, G.; Zambelli, G.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier
grade
Preferred source (of 2)‎

Power allocation schemes for multichannel two-hop relaying systems

2012 International Symposium on Wireless Communication Systems (ISWCS)
2012-08 | Conference paper
DOI: 10.1109/iswcs.2012.6328389
Contributors: Jose M. B. da Silva; Yuri C. B. Silva; Tarcisio F. Maciel; Francisco R. P. Cavalcanti; Carlos D. Rodrigues; Manoel B. Campelo Neto
Source: Self-asserted source
Manoel Campêlo via Crossref Metadata Search

A new facet generating procedure for the stable set polytope

Electronic Notes in Discrete Mathematics
2011 | Journal article
DOI: 10.1016/j.endm.2011.05.032
EID:

2-s2.0-80053078740
Contributors: Xavier, Á.S.; Campêlo, M.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

A combined parallel lagrangian decomposition and cutting-plane generation for maximum stable set problems

Electronic Notes in Discrete Mathematics
2010 | Journal article
DOI: 10.1016/j.endm.2010.05.064
EID:

2-s2.0-77954923930
Contributors: Campêlo, M.; Corrêa, R.C.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

On Lifting Integer Variables in Minimal Inequalities

Integer Programming and Combinatorial Optimization, Proceedings
2010 | Journal article
DOI: 10.1007/978-3-642-13036-6_7
Source: Self-asserted source
Manoel Campêlo

Stable sets, corner polyhedra and the Chvátal closure

Operations Research Letters
2009 | Journal article
DOI: 10.1016/j.orl.2009.06.006
EID:

2-s2.0-70349843353
Contributors: Campêlo, M.; Cornuéjols, G.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier
grade
Preferred source (of 2)‎

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

Electronic Notes in Discrete Mathematics
2009 | Journal article
DOI: 10.1016/j.endm.2009.11.016
EID:

2-s2.0-70949093426
Contributors: Campelo, M.; Cornuéjols, G.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier

Um algoritmo de planos-de-corte para o número cromático fracionário de um grafo

Pesquisa Operacional
2009 | Journal article
DOI: 10.1590/S0101-74382009000100009
WOSUID:

SCIELO:S0101-74382009000100009
Contributors: Campêlo, Manoel; Campos, Victor A.; Corrêa, Ricardo C.
Source: Self-asserted source
Manoel Campêlo via ResearcherID
grade
Preferred source (of 2)‎

On the asymmetric representatives formulation for the vertex coloring problem

Discrete Applied Mathematics
2008 | Journal article
DOI: 10.1016/j.dam.2007.05.058
EID:

2-s2.0-40149111192
Contributors: Campêlo, M.; Campos, V.A.; Corrêa, R.C.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier
grade
Preferred source (of 2)‎

Recent Hybrid Techniques for the Multi-Knapsack Problem

Principles and Practice of Constraint Programming
2008 | Book chapter
DOI: 10.1007/978-3-540-85958-1_41
Source: Self-asserted source
Manoel Campêlo

A simplex approach for finding local solutions of a linear bilevel program by equilibrium points

Annals of Operations Research
2005 | Journal article
DOI: 10.1007/s10479-005-2450-5
EID:

2-s2.0-24144436123
Contributors: Campêlo, M.; Scheimberg, S.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier
grade
Preferred source (of 2)‎

A study of local solutions in linear bilevel programming

Journal of Optimization Theory and Applications
2005 | Journal article
DOI: 10.1007/s10957-004-1711-9
EID:

2-s2.0-17444425729
Contributors: Campêlo, M.; Scheimberg, S.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier
grade
Preferred source (of 2)‎

On the asymmetric representatives formulation for the vertex coloring problem

Electronic Notes in Discrete Mathematics
2005-06 | Journal article
DOI: 10.1016/j.endm.2005.05.045
Contributors: Manoel Campêlo; Victor Campos; Ricardo Corrêa
Source: Self-asserted source
Manoel Campêlo via Crossref Metadata Search

A computational study of global algorithms for linear bilevel programming

Numerical Algorithms
2004 | Journal article
DOI: 10.1023/B:NUMA.0000021760.62160.a4
WOSUID:

WOS:000220453200003
Contributors: de Saboia, CHM; Campelo, M; Scheimberg, S
Source: Self-asserted source
Manoel Campêlo via ResearcherID
grade
Preferred source (of 2)‎

An ADD/DROP procedure for the capacitated plant location problem

Pesquisa Operacional
2004 | Journal article
DOI: 10.1590/S0101-74382004000100008
WOSUID:

SCIELO:S0101-74382004000100008
Contributors: Bornstein, Claudio Thomas; Campêlo, Manoel
Source: Self-asserted source
Manoel Campêlo via ResearcherID
grade
Preferred source (of 2)‎

Cliques, holes and the vertex coloring polytope

Information Processing Letters
2004 | Journal article
DOI: 10.1016/j.ipl.2003.11.005
EID:

2-s2.0-0346339489
Contributors: Campêlo, M.; Corrêa, R.; Frota, Y.
Source: Self-asserted source
Manoel Campêlo via Scopus - Elsevier
grade
Preferred source (of 2)‎

Theoretical and Computational Results for a Linear Bilevel Problem

Advances in Convex Analysis and Global Optimization
2001 | Other
DOI: 10.1007/978-1-4613-0279-7_14
Contributors: Manoel Campêlo; Susana Scheimberg
Source: Self-asserted source
Manoel Campêlo via Crossref Metadata Search

ADD/DROP PROCEDURES FOR THE CAPACITATED PLANT LOCATION PROBLEM

Electronic Notes in Discrete Mathematics
2001-04 | Journal article
DOI: 10.1016/s1571-0653(04)00235-5
Contributors: Manoel Campêlo; Cléudio Thomaz Bornstein
Source: Self-asserted source
Manoel Campêlo via Crossref Metadata Search

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

Electronic Notes in Discrete Mathematics
2001-04 | Journal article
DOI: 10.1016/s1571-0653(04)00251-3
Contributors: Manoel Campêlo; Ricardo Corrêa; Nelson Maculan; Fébio Protti
Source: Self-asserted source
Manoel Campêlo via Crossref Metadata Search

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

European Journal of Operational Research
2000 | Journal article
DOI: 10.1016/S0377-2217(99)00297-0
WOSUID:

WOS:000088925200017
Contributors: Campelo, M; Scheimberg, S
Source: Self-asserted source
Manoel Campêlo via ResearcherID
grade
Preferred source (of 2)‎

A note on a penalty function approach for solving bilevel linear programs

Journal of Global Optimization
2000 | Journal article
DOI: 10.1023/A:1008308218364
WOSUID:

WOS:000088032000004
Contributors: Campelo, M; Dantas, S; Scheimberg, S
Source: Self-asserted source
Manoel Campêlo via ResearcherID

Maximum vertex-weighted matching in strongly chordal graphs

Discrete Applied Mathematics
1998 | Journal article
DOI: 10.1016/S0166-218X(97)00136-4
WOSUID:

WOS:000074209900006
Contributors: Campelo, MB; Klein, S
Source: Self-asserted source
Manoel Campêlo via ResearcherID
grade
Preferred source (of 2)‎
How many people are using ORCID?