Manoel Campelo
Title
Cited by
Cited by
Year
On the asymmetric representatives formulation for the vertex coloring problem
M Campêlo, VA Campos, RC Corrêa
Discrete Applied Mathematics 156 (7), 1097-1111, 2008
1002008
Cliques, holes and the vertex coloring polytope
M Campêlo, R Corrêa, Y Frota
Information Processing Letters 89 (4), 159-164, 2004
792004
A note on a penalty function approach for solving bilevel linear programs
M Campelo, S Dantas, S Scheimberg
Journal of global optimization 16 (3), 245, 2000
402000
Unique lifting of integer variables in minimal inequalities
A Basu, M Campêlo, M Conforti, G Cornuéjols, G Zambelli
Mathematical Programming 141 (1-2), 561-576, 2013
272013
A note on a modified simplex approach for solving bilevel linear programming problems
M Campêlo, S Scheimberg
European Journal of Operational Research 126 (2), 454-458, 2000
252000
A computational study of global algorithms for linear bilevel programming
CHM de Sabóia, M Campêlo, S Scheimberg
Numerical Algorithms 35 (2-4), 155-173, 2004
242004
A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
M Campêlo, S Scheimberg
Annals of operations research 138 (1), 143-157, 2005
192005
On lifting integer variables in minimal inequalities
A Basu, M Campelo, M Conforti, G Cornuéjols, G Zambelli
International Conference on Integer Programming and Combinatorial …, 2010
172010
A study of local solutions in linear bilevel programming
M Campelo, S Scheimberg
Journal of optimization theory and applications 125 (1), 63-84, 2005
172005
A new facet generating procedure for the stable set polytope
AS Xavier, M Campêlo
Electronic Notes in Discrete Mathematics 37, 183-188, 2011
132011
Stable sets, corner polyhedra and the Chvátal closure
M Campêlo, G Cornuéjols
Operations Research Letters 37 (6), 375-378, 2009
132009
On the asymmetric representatives formulation for the vertex coloring problem
M Campêlo, V Campos, R Corrêa
Electronic Notes in Discrete Mathematics 19, 337-343, 2005
132005
The convex recoloring problem: polyhedra, facets and computational experiments
M Campêlo, AS Freire, KR Lima, PFS Moura, Y Wakabayashi
Mathematical Programming 156 (1-2), 303-330, 2016
122016
Polyhedral studies on the convex recoloring problem
M Campêlo, KR Lima, PFS Moura, Y Wakabayashi
Electronic Notes in Discrete Mathematics 44, 233-238, 2013
122013
An ADD/DROP procedure for the capacitated plant location problem
CT Bornstein, M Campêlo
Pesquisa Operacional 24 (1), 151-162, 2004
112004
A Lagrangian relaxation for the maximum stable set problem
M Campelo, RC Correa
arXiv preprint arXiv:0903.1407, 2009
92009
On the complexity of solving or approximating convex recoloring problems
MB Campêlo, CG Huiban, RM Sampaio, Y Wakabayashi
International Computing and Combinatorics Conference, 614-625, 2013
82013
On optimal k-fold colorings of webs and antiwebs
M Campêlo, RC Corrêa, PFS Moura, MC Santos
Discrete Applied Mathematics 161 (1-2), 60-70, 2013
72013
Hardness and inapproximability of convex recoloring problems
M Campêlo, C Huiban, RM Sampaio, Y Wakabayashi
Theoretical Computer Science 533, 15-25, 2014
62014
Um algoritmo de planos-de-corte para o número cromático fracionário de um grafo
M Campêlo, VA Campos, RC Corrêa
Pesquisa Operacional 29 (1), 179-193, 2009
52009
The system can't perform the operation now. Try again later.
Articles 1–20