Martine Labbé

ORCID

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 35

Top Venues

Publications

Pamela Bustamante-Faúndez, Víctor Bucarey López, Martine Labbé, Vladimir Marianov, Fernando Ordóñez
Branch-and-price with novel cuts, and a new Stackelberg Security Game. CoRR (2024)
Paulo Henrique Macêdo de Araújo, Manoel B. Campêlo, Ricardo C. Corrêa, Martine Labbé
Integer programming models and polyhedral study for the geodesic classification problem on graphs. Eur. J. Oper. Res. 314 (3) (2024)
Martine Labbé, Mercedes Landete, Marina Leal
Dendrograms, minimum spanning trees and feature selection. Eur. J. Oper. Res. 308 (2) (2023)
Javier Alcaraz, Martine Labbé, Mercedes Landete
Support Vector Machine with feature selection: A multiobjective approach. Expert Syst. Appl. 204 (2022)
Fränk Plein, Johannes Thürauf, Martine Labbé, Martin Schmidt
A bilevel optimization approach to decide the feasibility of bookings in the European gas market. Math. Methods Oper. Res. 95 (3) (2022)
Sebastián Dávila-Gálvez, Martine Labbé, Vladimir Marianov, Fernando Ordóñez, Frédéric Semet
Product line optimization with multiples sites. Comput. Oper. Res. 148 (2022)
Stefano Nasini, Martine Labbé, Luce Brotcorne
Multi-market portfolio optimization with conditional value at risk. Eur. J. Oper. Res. 300 (1) (2022)
Víctor Bucarey, Bernard Fortz, Natividad González-Blanco, Martine Labbé, Juan A. Mesa
Benders decomposition for network design covering problems. Comput. Oper. Res. 137 (2022)
Concepción Domínguez, Martine Labbé, Alfredo Marín
Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy. Comput. Oper. Res. 140 (2022)
Victor Bucarey, Sourour Elloumi, Martine Labbé, Fränk Plein
Models and algorithms for the product pricing with single-minded customers requesting bundles. Comput. Oper. Res. 127 (2021)
Martine Labbé, Miguel A. Pozo, Justo Puerto
Computational comparisons of different formulations for the Stackelberg minimum spanning tree game. Int. Trans. Oper. Res. 28 (1) (2021)
Thomas Kleinert, Martine Labbé, Ivana Ljubic, Martin Schmidt
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. EURO J. Comput. Optim. 9 (2021)
Thomas Kleinert, Martine Labbé, Fränk Plein, Martin Schmidt
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality. Optim. Lett. 15 (4) (2021)
Martine Labbé, Alfredo Marín, Mercedes Pelegrín
Finding the root graph through minimum edge deletion. Eur. J. Oper. Res. 289 (1) (2021)
Victor Bucarey, Carlos Casorrán, Martine Labbé, Fernando Ordóñez, Óscar Figueroa
Coordinating resources in Stackelberg Security Games. Eur. J. Oper. Res. 291 (3) (2021)
Concepción Domínguez, Martine Labbé, Alfredo Marín
The rank pricing problem with ties. Eur. J. Oper. Res. 294 (2) (2021)
Martine Labbé, Fränk Plein, Martin Schmidt, Johannes Thürauf
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks. Networks 78 (2) (2021)
Thomas Kleinert, Martine Labbé, Fränk Plein, Martin Schmidt
Technical Note - There's No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization. Oper. Res. 68 (6) (2020)
Luce Brotcorne, Bernard Fortz, Martine Labbé
Special issue on bilevel optimization. EURO J. Comput. Optim. 8 (1) (2020)
Samuel Deleplanque, Martine Labbé, Diego Ponce, Justo Puerto
A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem. INFORMS J. Comput. 32 (3) (2020)
Rosa Figueiredo, Yuri Frota, Martine Labbé
A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph. Discret. Appl. Math. 261 (2019)
Paulo Henrique Macêdo de Araújo, Manoel B. Campêlo, Ricardo C. Corrêa, Martine Labbé
The Geodesic Classification Problem on Graphs. LAGOS (2019)
Victor Bucarey, Martine Labbé
Discussion of Fairness and Implementability in Stackelberg Security Games. GameSec (2019)
Martine Labbé, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía
Mixed integer linear programming for feature selection in support vector machine. Discret. Appl. Math. 261 (2019)
Veronica Dal Sasso, Luigi De Giovanni, Martine Labbé
Strengthened Formulations and Valid Inequalities for Single Delay Management in Public Transportation. Transp. Sci. 53 (5) (2019)
Carlos Casorrán, Bernard Fortz, Martine Labbé, Fernando Ordóñez
A study of general and security Stackelberg game formulations. Eur. J. Oper. Res. 278 (3) (2019)
Herminia I. Calvete, Concepción Domínguez, Carmen Galé, Martine Labbé, Alfredo Marín
The rank pricing problem: Models and branch-and-cut algorithms. Comput. Oper. Res. 105 (2019)
Martine Labbé, Marina Leal, Justo Puerto
facilities: A bilevel programming approach. Comput. Oper. Res. 107 (2019)
Martine Labbé, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía
Mixed Integer Linear Programming for Feature Selection in Support Vector Machine. CoRR (2018)
Manlio Gaudioso, Enrico Gorgone, Martine Labbé, Antonio M. Rodríguez-Chía
Lagrangian relaxation for SVM feature selection. Comput. Oper. Res. 87 (2017)
Felipe Lagos, Fernando Ordóñez, Martine Labbé
A branch and price algorithm for a Stackelberg Security Game. Comput. Ind. Eng. 111 (2017)
Lorenzo Castelli, Martine Labbé, Alessia Violin
Network pricing problem with unit toll. Networks 69 (1) (2017)
Martine Labbé, Diego Ponce, Justo Puerto
A comparative study of formulations and solution methods for the discrete ordered p-median problem. Comput. Oper. Res. 78 (2017)
Martine Labbé, Alessia Violin
Bilevel programming and price setting problems. Ann. Oper. Res. 240 (1) (2016)
Veronica Dal Sasso, Luigi De Giovanni, Martine Labbé
A Column Generation Approach for Pure Parsimony Haplotyping. SCOR (2016)
Tue Rauff Lind Christensen, Martine Labbé
A branch-cut-and-price algorithm for the piecewise linear transportation problem. Eur. J. Oper. Res. 245 (3) (2015)
Daniele Catanzaro, Luis Eduardo Neves Gouveia, Martine Labbé
Improved integer linear programming formulations for the job Sequencing and tool Switching Problem. Eur. J. Oper. Res. 244 (3) (2015)
Sebastián Maldonado, Juan Pérez, Richard Weber, Martine Labbé
Feature selection for Support Vector Machines via Mixed Integer Linear Programming. Inf. Sci. 279 (2014)
Martine Labbé, Alessia Violin
Bilevel programming and price setting problems. 4OR 11 (1) (2013)
Martine Labbé, M. Grazia Speranza
Editorial. EURO J. Comput. Optim. 1 (1-2) (2013)
Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy
A branch-and-cut algorithm for the ring spur assignment problem. Networks 61 (2) (2013)
Bernard Fortz, Martine Labbé, François V. Louveaux, Michael Poss
Stochastic binary problems with simple penalties for capacity constraints violations. Math. Program. 138 (1-2) (2013)
Rosa M. V. Figueiredo, Yuri Frota, Martine Labbé
Solution of the Maximum $$k$$ k -Balanced Subgraph Problem. LION (2013)
Daniele Catanzaro, Martine Labbé, Raffaele Pesenti
The balanced minimum evolution problem under uncertain data. Discret. Appl. Math. 161 (13-14) (2013)
Bernard Fortz, Martine Labbé, Alessia Violin
Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs. Electron. Notes Discret. Math. 41 (2013)
Daniele Catanzaro, Martine Labbé, Bjarni V. Halldórsson
An Integer Programming Formulation of the Parsimonious Loss of Heterozygosity Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 10 (6) (2013)
Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González
The Balanced Minimum Evolution Problem. INFORMS J. Comput. 24 (2) (2012)
Daniele Catanzaro, Martine Labbé, Bjarni V. Halldórsson
A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem. ISBRA (2012)
Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González
Generalized network design polyhedra. Networks 58 (2) (2011)
Daniele Catanzaro, Martine Labbé, Martha Salazar-Neumann
Reduction approaches for robust shortest path problems. Comput. Oper. Res. 38 (11) (2011)
Sergio García, Martine Labbé, Alfredo Marín
-Median Problems with a Radius Formulation. INFORMS J. Comput. 23 (4) (2011)
Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy
Improved Formulations for the Ring Spur Assignment Problem. INOC (2011)
Rosa M. V. Figueiredo, Martine Labbé, Cid C. de Souza
An exact approach to the problem of extracting an embedded network matrix. Comput. Oper. Res. 38 (11) (2011)
Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard
Valid inequalities and branch-and-cut for the clique pricing problem. Discret. Optim. 8 (3) (2011)
Claudio Arbib, Martine Labbé, Mara Servilio
Scheduling two chains of unit jobs on one machine: A polyhedral study. Networks 58 (2) (2011)
Daniele Catanzaro, Éric Gourdin, Martine Labbé, F. Aykut Özsoy
A branch-and-cut algorithm for the partitioning-hub location-routing problem. Comput. Oper. Res. 38 (2) (2011)
Martine Labbé, F. Aykut Özsoy
Size-constrained graph partitioning polytopes. Discret. Math. 310 (24) (2010)
Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard
A polyhedral study of the network pricing problem with connected toll arcs. Networks 55 (3) (2010)
Daniele Catanzaro, Alessandra Godi, Martine Labbé
A Class Representative Model for Pure Parsimony Haplotyping. INFORMS J. Comput. 22 (2) (2010)
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) (2009)
Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop
Pricing Geometric Transportation Networks. Int. J. Comput. Geom. Appl. 19 (6) (2009)
Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman
Generating Facets for the Independence System Polytope. SIAM J. Discret. Math. 23 (3) (2009)
Daniele Catanzaro, Martine Labbé
The pure parsimony haplotyping problem: overview and computational advances. Int. Trans. Oper. Res. 16 (5) (2009)
Pierre Hansen, Martine Labbé, David Schindl
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. Discret. Optim. 6 (2) (2009)
Martine Labbé, Hande Yaman
Solving the hub location problem in a star-star network. Networks 51 (1) (2008)
Géraldine Heilporn, Luigi De Giovanni, Martine Labbé
Optimization models for the single delay management problem in public transportation. Eur. J. Oper. Res. 189 (3) (2008)
Paola Bertolazzi, Alessandra Godi, Martine Labbé, Leonardo Tininini
Solving haplotyping inference parsimony problem using a new basic polynomial formulation. Comput. Math. Appl. 55 (5) (2008)
Sophie Dewez, Martine Labbé, Patrice Marcotte, Gilles Savard
New formulations and valid inequalities for a bilevel pricing problem. Oper. Res. Lett. 36 (2) (2008)
Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman
to uncover optimal relationships. Networks 52 (4) (2008)
Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard
Joint Design and Pricing on a Network. Oper. Res. 56 (5) (2008)
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) (2007)
Pietro Belotti, Martine Labbé, Francesco Maffioli, Malick M. Ndiaye
-median problem. 4OR 5 (4) (2007)
Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard
On a network pricing problem with consecutive toll arcs. CTW (2007)
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) (2007)
Martine Labbé, Hande Yaman
Polyhedral Analysis for Concentrator Location Problems. Comput. Optim. Appl. 34 (3) (2006)
Martine Labbé, José Pinto Paixão, Maria Grazia Speranza
Preface. Ann. Oper. Res. 144 (1) (2006)
Martine Labbé
Bilevel Programming and Price Setting Problems. OR (2006)
Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
Locating median cycles in networks. Eur. J. Oper. Res. 160 (2) (2005)
Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop
Pricing of Geometric Transportation Networks. CCCG (2005)
Martine Labbé, Hande Yaman, Éric Gourdin
A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102 (2) (2005)
Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
A Tight Analysis of the Maximal Matching Heuristic. COCOON (2005)
Martine Labbé, Inmaculada Rodríguez Martín, Juan José Salazar González
A branch-and-cut algorithm for the plant-cycle location problem. J. Oper. Res. Soc. 55 (5) (2004)
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) (2004)
Corinne Feremans, Martine Labbé, Gilbert Laporte
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. Networks 43 (2) (2004)
Bernard Fortz, Martine Labbé
Two-Connected Networks with Rings of Bounded Cardinality. Comput. Optim. Appl. 27 (2) (2004)
Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn
Adapting polyhedral properties from facility to hub location problems. Discret. Appl. Math. 145 (1) (2004)
Martine Labbé, Hande Yaman
Projecting the flow variables for hub location problems. Networks 44 (2) (2004)
Sourour Elloumi, Martine Labbé, Yves Pochet
A New Formulation and Resolution Method for the p-Center Problem. INFORMS J. Comput. 16 (1) (2004)
Nenad Mladenovic, Martine Labbé, Pierre Hansen
Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. Networks 42 (1) (2003)
Corinne Feremans, Martine Labbé, Gilbert Laporte
Generalized network design problems. Eur. J. Oper. Res. 148 (1) (2003)
Martine Labbé, Gilbert Laporte, Silvano Martello
Upper bounds and algorithms for the maximum cardinality bin packing problem. Eur. J. Oper. Res. 149 (3) (2003)
Jean Cardinal, Sourour Elloumi, Martine Labbé
Local optimization of index assignments for multiple description coding. EUSIPCO (2002)
Corinne Feremans, Martine Labbé, Gilbert Laporte
A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39 (1) (2002)
Horst W. Hamacher, Martine Labbé, Stefan Nickel, Anders J. V. Skriver
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives. Ann. Oper. Res. 110 (1-4) (2002)
Bernard Fortz, Martine Labbé
Polyhedral results for two-connected networks with bounded rings. Math. Program. 93 (1) (2002)
Eugène Manzi, Martine Labbé, Guy Latouche, Francesco Maffioli
Fishman's sampling plan for computing network reliability. IEEE Trans. Reliab. 50 (1) (2001)
Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard
A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network. Transp. Sci. 35 (4) (2001)
Corinne Feremans, Martine Labbé, Gilbert Laporte
On generalized minimum spanning trees. Eur. J. Oper. Res. 134 (2) (2001)
Martine Labbé, Gilbert Laporte, Silvano Martello
Preface. Discret. Appl. Math. 112 (1-3) (2001)
Bernard Fortz, Martine Labbé, Francesco Maffioli
Solving the Two-Connected Network with Bounded Meshes Problem. Oper. Res. 48 (6) (2000)

Martine Labbé.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martine Labbé