 | 2011 |
|---|
| 9 |       | Luidi Simonetti,
Yuri Frota,
Cid C. de Souza:
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.
Discrete Applied Mathematics 159(16): 1901-1914 (2011) |
| 8 | | Luidi Simonetti,
Fábio Protti,
Yuri Frota,
Cid C. de Souza:
New branch-and-bound algorithms for k-cardinality tree problems.
Electronic Notes in Discrete Mathematics 37: 27-32 (2011) |
| 7 | | Edna Ayako Hoshino,
Yuri Frota,
Cid C. de Souza:
A branch-and-price approach for the partition coloring problem.
Oper. Res. Lett. 39(2): 132-137 (2011) |
| 2010 |
|---|
| 6 | | Yuri Frota,
Nelson Maculan,
Thiago F. Noronha,
Celso C. Ribeiro:
A branch-and-cut algorithm for partition coloring.
Networks 55(3): 194-204 (2010) |
| 2009 |
|---|
| 5 | | Edna Ayako Hoshino,
Yuri Frota,
Cid C. de Souza:
A Branch-and-Price Approach for the Partition Coloring Problem.
CTW 2009: 187-190 |
| 4 | | Luidi Simonetti,
Yuri Frota,
Cid C. de Souza:
An Exact Method for the Minimum Caterpillar Spanning Problem.
CTW 2009: 48-51 |
| 3 | | Laura Bahiense,
Yuri Frota,
Nelson Maculan,
Thiago F. Noronha,
Celso C. Ribeiro:
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives.
Electronic Notes in Discrete Mathematics 35: 347-352 (2009) |
| 2 | | Luidi Simonetti,
Yuri Frota,
Cid C. de Souza:
Upper and lower bounding procedures for the minimum caterpillar spanning problem.
Electronic Notes in Discrete Mathematics 35: 83-88 (2009) |
| 2004 |
|---|
| 1 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page