#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1998

2018

- This year (1)
- Last 5 years (18)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa
- Electronic Notes in Discrete Mathematics
- 2005

The representatives formulation for the vertex coloring problem is revisited to remove symmetry and new versions of facets derived from substructures of the graph are presented. In addition, a new… (More)

- Manoel B. Campêlo, Ricardo C. Corrêa, Yuri Frota
- Inf. Process. Lett.
- 2004

Certain subgraphs of a given graph G restrict the minimum number χ(G) of colors that can be assigned to the vertices of G such that the endpoints of all edges receive distinct colors. Some of such… (More)

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

We analyze two global algorithms for solving the linear bilevel program (LBP) problem. The first one is a recent algorithm built on a new concept of equilibrium point and a modified version of the… (More)

- Álinson S. Xavier, Manoel B. Campêlo
- Electronic Notes in Discrete Mathematics
- 2011

We introduce a new facet-generating procedure for the stable set polytope, based on replacing (k− 1)-cliques with certain k-partite graphs, which subsumes previous procedures based on replacing… (More)

- Manoel B. Campêlo, Gérard Cornuéjols
- Oper. Res. Lett.
- 2009

We consider the edge formulation of the stable set problem. We characterize its corner polyhedron, i.e. the convex hull of the points satisfying all the constraints except the non-negativity of the… (More)

- Manoel B. Campêlo, Sulamita Klein
- Discrete Applied Mathematics
- 1998

Given a graph G = (V, E) and a real weight for each vertex of G, the vertex-weight of a matching is defined to be the sum of the weights of the vertices covered by the matching. In this paper we… (More)

- Manoel B. Campêlo, Susana Scheimberg
- Annals OR
- 2005

In this paper, a linear bilevel programming problem (LBP) is considered. Local optimality conditions are derived. They are based on the notion of equilibrium point of an exact penalization for LBP.… (More)

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

This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tableau form where all… (More)

- Manoel B. Campêlo, Susana Scheimberg
- European Journal of Operational Research
- 2000

- Manoel B. Campêlo, Simone Dantas, Susana Scheimberg
- J. Global Optimization
- 2000