 | 2011 |
| 17 |  | Manoel B. Campêlo,
Ricardo C. Corrêa,
Phablo F. S. Moura,
Marcio C. Santos:
Optimal k-fold colorings of webs and antiwebs
CoRR abs/1108.5757: (2011) |
| 16 |  | Álinson S. Xavier,
Manoel B. Campêlo:
A New Facet Generating Procedure for the Stable Set Polytope.
Electronic Notes in Discrete Mathematics 37: 183-188 (2011) |
| 2010 |
| 15 |  | 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 |
| 14 |  | Manoel B. Campêlo,
Ricardo C. Corrêa:
A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems.
Electronic Notes in Discrete Mathematics 36: 503-510 (2010) |
| 2009 |
| 13 |  | Manoel B. Campêlo,
Ricardo C. Corrêa:
A Lagrangian Relaxation for the Maximum Stable Set Problem
CoRR abs/0903.1407: (2009) |
| 12 |  | Manoel B. Campêlo,
Gérard Cornuéjols:
The Chvátal closure of generalized stable sets in bidirected graphs.
Electronic Notes in Discrete Mathematics 35: 89-95 (2009) |
| 11 |  | 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) |
| 2008 |
| 10 |  | Carlos Diego Rodrigues,
Philippe Michelon,
Manoel B. Campêlo:
Recent Hybrid Techniques for the Multi-Knapsack Problem.
CP 2008: 555-559 |
| 9 |  | Manoel B. Campêlo,
Victor A. Campos,
Ricardo C. Corrêa:
On the asymmetric representatives formulation for the vertex coloring problem.
Discrete Applied Mathematics 156(7): 1097-1111 (2008) |
| 2005 |
| 8 |  | Manoel B. Campêlo,
Susana Scheimberg:
A Simplex Approach for Finding Local Solutions of a Linear Bilevel Program by Equilibrium Points.
Annals OR 138(1): 143-157 (2005) |
| 7 |  | Manoel B. Campêlo,
Victor A. Campos,
Ricardo C. Corrêa:
On the asymmetric representatives formulation for the vertex coloring problem.
Electronic Notes in Discrete Mathematics 19: 337-343 (2005) |
| 2004 |
| 6 |  | 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) |
| 5 |  | Carlos Henrique Medeiros de Sabóia,
Manoel B. Campêlo,
Susana Scheimberg:
A Computational Study of Global Algorithms for Linear Bilevel Programming.
Numerical Algorithms 35(2-4): 155-173 (2004) |
| 2001 |
| 4 |  | Manoel B. Campêlo,
Claudio T. Bornstein:
Add/Drop Procedures for the Capacitated Plant Location Problem.
Electronic Notes in Discrete Mathematics 7: 102-105 (2001) |
| 3 |  | 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.
Electronic Notes in Discrete Mathematics 7: 166-169 (2001) |
| 2000 |
| 2 |  | Manoel B. Campêlo,
Susana Scheimberg:
A note on a modified simplex approach for solving bilevel linear programming problems.
European Journal of Operational Research 126(2): 454-458 (2000) |
| 1998 |
| 1 |  | Manoel B. Campêlo,
Sulamita Klein:
Maximum Vertex-weighted Matching in Strongly Chordal Graphs.
Discrete Applied Mathematics 84(1-3): 71-77 (1998) |