2009 | ||
---|---|---|
38 | EE | Pierre Hansen, Martine Labbé, David Schindl: Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. Discrete Optimization 6(2): 135-147 (2009) |
37 | EE | Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González: Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. Networks 53(2): 126-140 (2009) |
2008 | ||
36 | EE | Géraldine Heilporn, Luigi De Giovanni, Martine Labbé: Optimization models for the single delay management problem in public transportation. European Journal of Operational Research 189(3): 762-774 (2008) |
35 | EE | Martine Labbé, Hande Yaman: Solving the hub location problem in a star-star network. Networks 51(1): 19-33 (2008) |
34 | EE | Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman: Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks 52(4): 287-298 (2008) |
33 | EE | Sophie Dewez, Martine Labbé, Patrice Marcotte, Gilles Savard: New formulations and valid inequalities for a bilevel pricing problem. Oper. Res. Lett. 36(2): 141-149 (2008) |
2007 | ||
32 | Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard: On a network pricing problem with consecutive toll arcs. CTW 2007: 67-68 | |
31 | EE | Pietro Belotti, Martine Labbé, Francesco Maffioli, Malick M. Ndiaye: A branch-and-cut method for the obnoxious p -median problem. 4OR 5(4): 299-314 (2007) |
30 | EE | David Huygens, Martine Labbé, Ali Ridha Mahjoub, Pierre Pesneau: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. Networks 49(1): 116-133 (2007) |
29 | EE | Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín: A strengthened formulation for the simple plant location problem with order. Oper. Res. Lett. 35(2): 141-150 (2007) |
2006 | ||
28 | EE | Martine Labbé: Bilevel Programming and Price Setting Problems. OR 2006: 109 |
27 | EE | Martine Labbé, José Paixão, Maria Grazia Speranza: Preface. Annals OR 144(1): 1 (2006) |
2005 | ||
26 | EE | Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop: Pricing of Geometric Transportation Networks. CCCG 2005: 92-96 |
25 | EE | Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot: A Tight Analysis of the Maximal Matching Heuristic. COCOON 2005: 701-709 |
24 | EE | Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González: Locating median cycles in networks. European Journal of Operational Research 160(2): 457-470 (2005) |
23 | EE | Martine Labbé, Hande Yaman, Éric Gourdin: A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102(2): 371-405 (2005) |
2004 | ||
22 | EE | Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn: Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics 145(1): 104-116 (2004) |
21 | EE | Sourour Elloumi, Martine Labbé, Yves Pochet: A New Formulation and Resolution Method for the p-Center Problem. INFORMS Journal on Computing 16(1): 83-94 (2004) |
20 | EE | 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) |
19 | EE | Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González: The Ring Star Problem: Polyhedral analysis and exact algorithm. Networks 43(3): 177-189 (2004) |
18 | EE | Martine Labbé, Hande Yaman: Projecting the flow variables for hub location problems. Networks 44(2): 84-93 (2004) |
2003 | ||
17 | EE | Corinne Feremans, Martine Labbé, Gilbert Laporte: Generalized network design problems. European Journal of Operational Research 148(1): 1-13 (2003) |
16 | EE | Martine Labbé, Gilbert Laporte, Silvano Martello: Upper bounds and algorithms for the maximum cardinality bin packing problem. European Journal of Operational Research 149(3): 490-498 (2003) |
15 | EE | Nenad Mladenovic, Martine Labbé, Pierre Hansen: Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. Networks 42(1): 48-64 (2003) |
2002 | ||
14 | EE | Horst W. Hamacher, Martine Labbé, Stefan Nickel, Anders J. V. Skriver: Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives. Annals OR 110(1-4): 33-53 (2002) |
13 | EE | 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 | ||
12 | Martine Labbé, Gilbert Laporte, Silvano Martello: Preface. Discrete Applied Mathematics 112(1-3): 1 (2001) | |
1999 | ||
11 | EE | János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang: Two Simple Algorithms for bin Covering. Acta Cybern. 14(1): 13-26 (1999) |
10 | EE | 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) |
9 | EE | Horst W. Hamacher, Martine Labbé, Stefan Nickel: Multicriteria network location problems with sum objectives. Networks 33(2): 79-92 (1999) |
8 | EE | S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel: Locations on time-varying networks. Networks 34(4): 250-257 (1999) |
7 | EE | Mauro Dell'Amico, Martine Labbé, Francesco Maffioli: Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25(3): 119-129 (1999) |
1998 | ||
6 | EE | Martine Labbé, Gilbert Laporte, Patrick Soriano: Covering a graph with cycles. Computers & OR 25(6): 499-504 (1998) |
1996 | ||
5 | EE | Mauro Dell'Amico, Martine Labbé, Francesco Maffioli: Complexity of spanning tree problems with leaf-dependent objectives. Networks 27(3): 175-181 (1996) |
1993 | ||
4 | EE | János Csirik, J. B. G. Frenk, Martine Labbé: Two-Dimensional Rectangle Packing: On-Line Methods and Results. Discrete Applied Mathematics 45(3): 197-204 (1993) |
1991 | ||
3 | EE | János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang: Heuristic for the 0-1 Min-Knapsack Problem. Acta Cybern. 10(1-2): 15-20 (1991) |
2 | EE | Pierre Hansen, Martine Labbé, Brigitte Nicolas: The continuous center set of a network. Discrete Applied Mathematics 30(2-3): 181-195 (1991) |
1990 | ||
1 | János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang: On the multidimensional vector bin packing. Acta Cybern. 9(4): 361-369 (1990) |