 | 2011 |
|---|
| 10 |       | Corinne Feremans,
Martine Labbé,
Adam N. Letchford,
Juan José Salazar González:
Generalized network design polyhedra.
Networks 58(2): 125-136 (2011) |
| 2009 |
|---|
| 9 | | Hans L. Bodlaender,
Corinne Feremans,
Alexander Grigoriev,
Eelko Penninkx,
René Sitters,
Thomas Wolle:
On the minimum corridor connection problem and other generalized geometric problems.
Comput. Geom. 42(9): 939-951 (2009) |
| 2006 |
|---|
| 8 | | Hans L. Bodlaender,
Corinne Feremans,
Alexander Grigoriev,
Eelko Penninkx,
René Sitters,
Thomas Wolle:
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.
WAOA 2006: 69-82 |
| 7 | | Corinne Feremans,
Alexander Grigoriev,
René Sitters:
The geometric generalized minimum spanning tree problem with grid clustering.
4OR 4(4): 319-329 (2006) |
| 2005 |
|---|
| 6 | | Corinne Feremans,
Alexander Grigoriev:
Approximation schemes for the generalized geometric problems with geographic clustering.
EuroCG 2005: 101-102 |
| 2004 |
|---|
| 5 | | Corinne Feremans,
Martine Labbé,
Gilbert Laporte:
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm.
Networks 43(2): 71-86 (2004) |
| 2003 |
|---|
| 4 | | Corinne Feremans,
Martine Labbé,
Gilbert Laporte:
Generalized network design problems.
European Journal of Operational Research 148(1): 1-13 (2003) |
| 2002 |
|---|
| 3 | | Corinne Feremans,
Martine Labbé,
Gilbert Laporte:
A comparative analysis of several formulations for the generalized minimum spanning tree problem.
Networks 39(1): 29-34 (2002) |
| 2001 |
|---|
| 2 | | Corinne Feremans,
Martine Labbé,
Gilbert Laporte:
On generalized minimum spanning trees.
European Journal of Operational Research 134(2): 457-458 (2001) |
| 1999 |
|---|
| 1 | | Corinne Feremans,
Martine Labbé,
Gilbert Laporte:
The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut.
Electronic Notes in Discrete Mathematics 3: 45-50 (1999) |
Data released under the ODC-BY 1.0 license — See also our legal information page