- M. Labbé and H. Yaman, "Polyhedral Analysis for Concentrator Location Problems", Computational Optimization and Applications, to appear.
- M. Labbé, H. Yaman and E. Gourdin (2005), "A Branch and Cut Algorithm for Hub Location Problems with Single Assignment", Mathematical Programming, Vol. 102, 371-405.
- M. Labbé, G. Laporte, I. Rodriguez Martin, J.J. Salazar (2005), "Locating median cycles in networks", European Journal of Operational Research, Vol. 160, 457-470.
- M. Labbé and H. Yaman (2004), "Projecting the flow variables for hub location problems", Networks, Vol. 44, 84-93.
- W.H. Hamacher, M. Labbé, S. Nickel, and T. Sonneborn (2004), "Adapting Polyhedral
Properties from Facility to Hub Location Problems", Discrete Applied Mathematics, Vol.145, 104-116.
- M. Labbé, G. Laporte, I. Rodriguez Martin, J.J.
Salazar (2004), "The Ring Star Problem: Polyhedral Analysis and Exact
Algorithm", Networks, Vol.43, 177-189. This paper won the 2004 Glover-Klingman
Prize for the best paper published in Networks during 2004.
- S. Elloumi, M. Labbé, and Y. Pochet (2004), "New formulation and resolution method for the $p$-center problem", INFORMS Journal on Computing, Vol.16, 84-94.
- M. Labbé, I. Rodriguez Martin and J.J. Salazar (2004), "A Branch-and-Cut Algorithm for the Plant-Cycle Location Problem",Journal of the Operational Research Society, Vol. 55, 513-520.
- C. Feremans, M. Labbé, and G. Laporte (2004), "The Generalized
Minimum Spanning Tree Problem: Polyhedral Analysis and
Branch-and-Cut Algorithm", Networks, Vol.43, 71-86.
- B. Fortz and M. Labbé (2004), ``Two-connected networks with rings of bounded cardinality'', Computational Optimization and Applications, Vol. 27, 123-148.
- V. Devloo, P. Hansen and M.Labbé (2003), "Identification of all steady states in large networks by logical analysis", Bulletin of mathematical biology, Vol. 65, 1025-1051.
- M. Labbé, G. Laporte, and S. Martello (2003), "Upper bounds and algorithms for the maximum cardinality bin packing problem", European Journal Operational Research, Vol.149, 490-498.
- N. Mladenovic, M. Labbé, and P. Hansen (2003), "Solving the p-Center Problem with Tabu Search and Variable Neighborhood Search", Networks Vol. 42, 48-64.
- C. Feremans, M. Labbé, and G. Laporte (2003), "Generalized Network Design Problems", European Journal of Operational Research, Vol. 148, 1-13.
- M. Patricksson and M. Labbé eds. (2002), Transportation Planning: State of the Art, Kluwer Academic Publishers.
- W.H. Hamacher, M. Labbé, S. Nickel, and A.J.V. Skriver (2002),"Multicriteria Semi-obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives", Annals of Operations Research, Vol. 110, 33-53.
- B. Fortz and M. Labbé (2002), "Exact and heuristic algorithms for the design of survivable networks with bounded rings", Mathematical Programming, Vol.93, 27-54.
- L. Brotcorne, D. De Wolf, M. Gendreau, and M. Labbé (2002), "A dynamic user equilibrium model for traffic assignment in urban areas", in Transportation and network analysis: current trends, M. Gendreau and P. Marcotte (eds.), Kluwer Academic Publishers, 49-69.
- C. Feremans, M. Labbé, and G.Laporte (2002), "A Comparative Analysis of Several Formulations for the Generalized Minimum Spanning Tree Problem", Networks, Vol. 39, 29-34.
- E. Gourdin, M. Labbé and H. Yaman (2002), "Telecommunication and Location", Facility Location: Applications and Theory, Drezner Z. and Hamacher H.W. (Eds.), Springer, 275-305.
- L. Brotcorne, M. Labbé, P. Marcotte, and G. Savard (2001), "A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network", Transportation Science, Vol. 35, 345-358.
- E. Manzi, M. Labbé, And. F. Maffioli (2001), "On fishman's sampling plan for computing network reliability", IEEE Transactions in reliability, Vol. 50, NO. 1, 41-46.
- M. Labbé, G. Laporte and S. Martello, Guest editors (2001) Combinatorial Optimization Symposium, Special Issue of Discrete Applied mathematics,Vol. 112, N 1-3, pp. 1-330.
- C. Feremans, M. Labbé, and G. Laporte (2001), "On Generalized Minimum Spanning Trees", European Journal of Operational Research, Vol. 134, 457-458.
|
- Colloque du 10eme anniversaire du LAMIH, Université du Mont Houy de Valenciennes, France, March 2005.
- AIRO winter conference, Cortina, Italy, February 2005.
- TraLog, Transportation and Logistics conference, Molde, Norway, August 2004.
- Deuxième journée du groupe de travail en programmation Mathématique, CNAM, Paris, April 2004.
- ORP3, Lambrecht, Germany, September 2003.
- AIRO winter conference, Champoluc, Italy, February 2003.
- Workshop "Distribution Systems: Location and Vehicle Routing", Montreal, December 2002.
- Nordic Mathematical Programming Symposium, Bergen, September 2002.
- France Télécom R&D - 6th Optimization Seminar, April 2002.
- Combinatorial Optimization 2002, April 2002.
- Internationale Conference on Optimization - SIGOPT - Deutsche Mathematiker Vereinigung, Lambrecht, February 2002.
- CRM-MITACS Spring School of Optimization, Montreal, May 2001.
- Deuxième Ecole d'Hiver des Télécommunications de Sophia-Antipolis, December 1999.
- ALIO-EURO meeting on Practical Combinatorial Optimization, November 1999.
|