default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManoel B. Campêlo
Person information
- affiliation: Federal University of Ceará, Department of Statistics and Applied Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]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): 894-911 (2024)- 2023
- [j41]Manoel B. Campêlo, Jhonata A. S. Matias:
A strongly polynomial algorithm for the minimum maximum flow degree problem. Oper. Res. Lett. 51(1): 67-71 (2023) - [j40]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): 1821-1841 (2023) - 2022
- [j39]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): 1267-1278 (2022) - [j38]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): 1573-1574 (2022) - [j37]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: 134-148 (2022) - [j36]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): 54-65 (2022) - 2021
- [j35]Manoel B. Campêlo, Tatiane Fernandes Figueiredo:
Integer programming approaches to the multiple team formation problem. Comput. Oper. Res. 133: 105354 (2021) - [j34]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: 26-48 (2021) - [j33]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): 3147-3171 (2021) - [j32]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): 125-150 (2021) - [j31]Pablo Soares, Manoel B. Campêlo:
t-Linearization for the maximum diversity problem. Optim. Lett. 15(8): 2879-2895 (2021) - 2020
- [j30]Manoel B. Campêlo, Tatiane Fernandes Figueiredo, Ana Silva:
The sociotechnical teams formation problem: a mathematical optimization approach. Ann. Oper. Res. 286(1): 201-216 (2020) - [j29]Luiz Alberto do Carmo Viana, Manoel B. Campêlo:
Two dependency constrained spanning tree problems. Int. Trans. Oper. Res. 27(2): 867-898 (2020) - [i8]Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva:
A Unifying Model for Locally Constrained Spanning Tree Problems. CoRR abs/2005.10328 (2020)
2010 – 2019
- 2019
- [c6]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: 65-76 - [c5]Luiz Alberto do Carmo Viana, Manoel B. Campêlo:
The Generalized Dependency Constrained Spanning Tree Problem. LAGOS 2019: 711-723 - [i7]Manoel B. Campêlo, Phablo F. S. Moura, Joel C. Soares:
Polyhedral study of the Convex Recoloring problem. CoRR abs/1911.11099 (2019) - [i6]Manoel B. Campêlo, Daniel Severín:
An integer programming approach for solving a generalized version of the Grundy domination number. CoRR abs/1912.12752 (2019) - 2018
- [j28]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: 1-3 (2018) - [i5]Manoel B. Campêlo, Daniel Severín:
The polytope of legal sequences. CoRR abs/1811.12360 (2018) - 2017
- [j27]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: 46-61 (2017) - [j26]Manoel B. Campêlo, Daniel E. Severín:
Facets of the polytope of legal sequences. Electron. Notes Discret. Math. 62: 15-20 (2017) - [j25]Rafael Andrade, Tibérius O. Bonates, Manoel B. Campêlo, Mardson Ferreira:
Minimum Linear Arrangements. Electron. Notes Discret. Math. 62: 63-68 (2017) - 2016
- [j24]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: 223-234 (2016) - [j23]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: 131-156 (2016) - [j22]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): 303-330 (2016) - 2015
- [j21]Manoel B. Campêlo, Cristiana Gomes Huiban, Carlos Diego Rodrigues, Rudini M. Sampaio:
On the complexity of the flow coloring problem. Discret. Appl. Math. 197: 75-92 (2015) - [j20]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: 1-2 (2015) - [i4]Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos:
Facet-defining inequalities for the representatives k-fold coloring polytope. CTW 2015: 73-76 - [i3]Manoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi:
Convex recoloring: inapproximability and a polyhedral study. CTW 2015: 117-120 - 2014
- [j19]Manoel B. Campêlo, Cristiana Gomes Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi:
Hardness and inapproximability of convex recoloring problems. Theor. Comput. Sci. 533: 15-25 (2014) - 2013
- [j18]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): 60-70 (2013) - [j17]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: 233-238 (2013) - [j16]Manoel B. Campêlo, Phablo F. S. Moura, Marcio Costa Santos:
On the representatives k-fold coloring polytope. Electron. Notes Discret. Math. 44: 239-244 (2013) - [j15]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): 561-576 (2013) - [c4]Manoel B. Campêlo, Cristiana Gomes Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi:
On the Complexity of Solving or Approximating Convex Recoloring Problems. COCOON 2013: 614-625 - 2012
- [c3]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:
Power allocation schemes for multichannel two-hop relaying systems. ISWCS 2012: 356-360 - 2011
- [j14]Álinson S. Xavier, Manoel B. Campêlo:
A New Facet Generating Procedure for the Stable Set Polytope. Electron. Notes Discret. Math. 37: 183-188 (2011) - [i2]Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio Costa Santos:
Optimal k-fold colorings of webs and antiwebs. CoRR abs/1108.5757 (2011) - 2010
- [j13]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: 503-510 (2010) - [c2]Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
On Lifting Integer Variables in Minimal Inequalities. IPCO 2010: 85-95
2000 – 2009
- 2009
- [j12]Manoel B. Campêlo, Gérard Cornuéjols:
The Chvátal closure of generalized stable sets in bidirected graphs. Electron. Notes Discret. Math. 35: 89-95 (2009) - [j11]Manoel B. Campêlo, Gérard Cornuéjols:
Stable sets, corner polyhedra and the Chvátal closure. Oper. Res. Lett. 37(6): 375-378 (2009) - [i1]Manoel B. Campêlo, Ricardo C. Corrêa:
A Lagrangian Relaxation for the Maximum Stable Set Problem. CoRR abs/0903.1407 (2009) - 2008
- [j10]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): 1097-1111 (2008) - [c1]Carlos Diego Rodrigues, Philippe Michelon, Manoel B. Campêlo:
Recent Hybrid Techniques for the Multi-Knapsack Problem. CP 2008: 555-559 - 2005
- [j9]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): 143-157 (2005) - [j8]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: 337-343 (2005) - 2004
- [j7]Manoel B. Campêlo, Ricardo C. Corrêa, Yuri Frota:
Cliques, holes and the vertex coloring polytope. Inf. Process. Lett. 89(4): 159-164 (2004) - [j6]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): 155-173 (2004) - 2001
- [j5]Manoel B. Campêlo, Claudio T. Bornstein:
Add/Drop Procedures for the Capacitated Plant Location Problem. Electron. Notes Discret. Math. 7: 102-105 (2001) - [j4]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: 166-169 (2001) - 2000
- [j3]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): 454-458 (2000) - [j2]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): 245-255 (2000)
1990 – 1999
- 1998
- [j1]Manoel B. Campêlo, Sulamita Klein:
Maximum Vertex-weighted Matching in Strongly Chordal Graphs. Discret. Appl. Math. 84(1-3): 71-77 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
