|
Search the dblp DataBase
Martine Labbé:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop
Pricing of Geometric Transportation Networks. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:92-96 [Conf]
- Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
A Tight Analysis of the Maximal Matching Heuristic. [Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:701-709 [Conf]
- János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang
On the multidimensional vector bin packing. [Citation Graph (0, 0)][DBLP] Acta Cybern., 1990, v:9, n:4, pp:361-369 [Journal]
- János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang
Heuristic for the 0-1 Min-Knapsack Problem. [Citation Graph (0, 0)][DBLP] Acta Cybern., 1991, v:10, n:1-2, pp:15-20 [Journal]
- János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang
Two Simple Algorithms for bin Covering. [Citation Graph (0, 0)][DBLP] Acta Cybern., 1999, v:14, n:1, pp:13-26 [Journal]
- Martine Labbé, Gilbert Laporte, Patrick Soriano
Covering a graph with cycles. [Citation Graph (0, 0)][DBLP] Computers & OR, 1998, v:25, n:6, pp:499-504 [Journal]
- János Csirik, J. B. G. Frenk, Martine Labbé
Two-Dimensional Rectangle Packing: On-Line Methods and Results. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:45, n:3, pp:197-204 [Journal]
- Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn
Adapting polyhedral properties from facility to hub location problems. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:145, n:1, pp:104-116 [Journal]
- Martine Labbé, Gilbert Laporte, Silvano Martello
Preface. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:1- [Journal]
- Sourour Elloumi, Martine Labbé, Yves Pochet
A New Formulation and Resolution Method for the p-Center Problem. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2004, v:16, n:1, pp:83-94 [Journal]
- Martine Labbé, Hande Yaman, Eric Gourdin
A branch and cut algorithm for hub location problems with single assignment. [Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:371-405 [Journal]
- Mauro Dell'Amico, Martine Labbé, Francesco Maffioli
Complexity of spanning tree problems with leaf-dependent objectives. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:27, n:3, pp:175-181 [Journal]
- Corinne Feremans, Martine Labbé, Gilbert Laporte
A comparative analysis of several formulations for the generalized minimum spanning tree problem. [Citation Graph (0, 0)][DBLP] Networks, 2002, v:39, n:1, pp:29-34 [Journal]
- Corinne Feremans, Martine Labbé, Gilbert Laporte
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:43, n:2, pp:71-86 [Journal]
- S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel
Locations on time-varying networks. [Citation Graph (0, 0)][DBLP] Networks, 1999, v:34, n:4, pp:250-257 [Journal]
- Horst W. Hamacher, Martine Labbé, Stefan Nickel
Multicriteria network location problems with sum objectives. [Citation Graph (0, 0)][DBLP] Networks, 1999, v:33, n:2, pp:79-92 [Journal]
- Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
The Ring Star Problem: Polyhedral analysis and exact algorithm. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:43, n:3, pp:177-189 [Journal]
- Martine Labbé, Hande Yaman
Projecting the flow variables for hub location problems. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:2, pp:84-93 [Journal]
- Nenad Mladenovic, Martine Labbé, Pierre Hansen
Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. [Citation Graph (0, 0)][DBLP] Networks, 2003, v:42, n:1, pp:48-64 [Journal]
- Mauro Dell'Amico, Martine Labbé, Francesco Maffioli
Exact solution of the SONET Ring Loading Problem. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1999, v:25, n:3, pp:119-129 [Journal]
- Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín
A strengthened formulation for the simple plant location problem with order. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2007, v:35, n:2, pp:141-150 [Journal]
- Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
Locating median cycles in networks. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:160, n:2, pp:457-470 [Journal]
- Corinne Feremans, Martine Labbé, Gilbert Laporte
Generalized network design problems. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:148, n:1, pp:1-13 [Journal]
- Martine Labbé, Gilbert Laporte, Silvano Martello
Upper bounds and algorithms for the maximum cardinality bin packing problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:149, n:3, pp:490-498 [Journal]
Bilevel Programming and Price Setting Problems. [Citation Graph (, )][DBLP]
On a network pricing problem with consecutive toll arcs. [Citation Graph (, )][DBLP]
A branch-and-cut method for the obnoxious p -median problem. [Citation Graph (, )][DBLP]
A branch-and-cut algorithm for the partitioning-hub location-routing problem. [Citation Graph (, )][DBLP]
The continuous center set of a network. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.298secs
|