|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Álinson S. Xavier, Manoel B. Campêlo |
A New Facet Generating Procedure for the Stable Set Polytope.  |
Electronic Notes in Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoel B. Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura, Marcio C. Santos |
Optimal k-fold colorings of webs and antiwebs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli |
On Lifting Integer Variables in Minimal Inequalities. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoel B. Campêlo, Gérard Cornuéjols |
Stable sets, corner polyhedra and the Chvátal closure. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoel B. Campêlo, Gérard Cornuéjols |
The Chvátal closure of generalized stable sets in bidirected graphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoel B. Campêlo, Ricardo C. Corrêa |
A Lagrangian Relaxation for the Maximum Stable Set Problem |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Manoel B. Campêlo, Victor A. Campos, Ricardo C. Corrêa |
On the asymmetric representatives formulation for the vertex coloring problem. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Diego Rodrigues, Philippe Michelon, Manoel B. Campêlo |
Recent Hybrid Techniques for the Multi-Knapsack Problem. |
CP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoel B. Campêlo, Susana Scheimberg |
A Simplex Approach for Finding Local Solutions of a Linear Bilevel Program by Equilibrium Points. |
Annals OR |
2005 |
DBLP DOI BibTeX RDF |
bilevel linear programming, simplex method, local optimization |
| 1 | Manoel B. Campêlo, Ricardo C. Corrêa, Yuri Frota |
Cliques, holes and the vertex coloring polytope. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Henrique Medeiros de Sabóia, Manoel B. Campêlo, Susana Scheimberg |
A Computational Study of Global Algorithms for Linear Bilevel Programming. |
Numerical Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoel B. Campêlo, Claudio T. Bornstein |
Add/Drop Procedures for the Capacitated Plant Location Problem. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoel B. Campêlo, Susana Scheimberg |
A note on a modified simplex approach for solving bilevel linear programming problems. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoel B. Campêlo, Sulamita Klein |
Maximum Vertex-weighted Matching in Strongly Chordal Graphs. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")