Algorithms for Voting and Competitive Location on a Network. - Pierre Hansen; Martine Labbé (Transp. Sci., 1988)

The continuous p-median of a network. - Pierre Hansen; Martine Labbé (Networks, 1989)

A tree-network has the fixed point property. - Martine Labbé; Jacques-François Thisse (Networks, 1989)

Competitive Location with Random Utilities. - André de Palma; Victor Ginsburgh; Martine Labbé; Jacques-François Thisse (Transp. Sci., 1989)

On the multidimensional vector bin packing. - János Csirik; J. B. G. Frenk; Martine Labbé; Shuzhong Zhang (Acta Cybern., 1990)

Location of an obnoxious facility on a network: A voting approach. - Martine Labbé (Networks, 1990)

Bibliographic Section. - Martine Labbé; Sue McNeil; Michael D. Meyer; Avishai Ceder (Transp. Sci., 1990)

Commuters' Paths with Penalties for Early or Late Arrival Time. - André de Palma; Pierre Hansen; Martine Labbé (Transp. Sci., 1990)

Heuristic for the 0-1 Min-Knapsack Problem. - János Csirik; J. B. G. Frenk; Martine Labbé; Shuzhong Zhang (Acta Cybern., 1991)

The continuous center set of a network. - Pierre Hansen; Martine Labbé; Brigitte Nicolas (Discret. Appl. Math., 1991)

Market and Locational Equilibrium for Two Competitors. - Martine Labbé; S. Louis Hakimi (Oper. Res., 1991)

Capacitated Vehicle Routing on Trees. - Martine Labbé; Gilbert Laporte; Hélène Mercure (Oper. Res., 1991)

Sensitivity Analysis in Minisum Facility Location Problems. - Martine Labbé; Jacques-François Thisse; Richard E. Wendell (Oper. Res., 1991)

The Voronoi Partition of a Network and Its Implications in Location Theory. - S. Louis Hakimi; Martine Labbé; Edward F. Schmeichel (INFORMS J. Comput., 1992)

Two-Dimensional Rectangle Packing: On-Line Methods and Results. - János Csirik; J. B. G. Frenk; Martine Labbé (Discret. Appl. Math., 1993)

On locating path- or tree-shaped facilities on networks. - S. Louis Hakimi; Edward F. Schmeichel; Martine Labbé (Networks, 1993)

A note on a stochastic location problem. - J. B. G. Frenk; Martine Labbé; Shuzhong Zhang (Oper. Res. Lett., 1993)

Improved Algorithms for Machine Allocation in Manufacturing Systems. - Hans Frenk; Martine Labbé; Mario van Vliet; Shuzhong Zhang (Oper. Res., 1994)

Approximation algorithms for the capacitated plant allocation problem. - Martine Labbé; Edward F. Schmeichel; S. Louis Hakimi (Oper. Res. Lett., 1994)

An exact algorithm for the dual bin packing problem. - Martine Labbé; Gilbert Laporte; Silvano Martello (Oper. Res. Lett., 1995)

Efficient heuristics for the design of ring networks. - Michel Gendreau; Martine Labbé; Gilbert Laporte (Telecommun. Syst., 1995)

On the Two-Level Uncapacitated Facility Location Problem. - Karen I. Aardal; Martine Labbé; Janny Leung; Maurice Queyranne (INFORMS J. Comput., 1996)

Complexity of spanning tree problems with leaf-dependent objectives. - Mauro Dell'Amico; Martine Labbé; Francesco Maffioli (Networks, 1996)

Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]. - Martine Labbé; Edward F. Schmeichel; S. Louis Hakimi (Oper. Res. Lett., 1996)

Covering a graph with cycles. - Martine Labbé; Gilbert Laporte; Patrick Soriano (Comput. Oper. Res., 1998)

TSS Dissertation Abstracts - Abstracts for the 1997 Transportation Science Section Dissertation Prize Competition. - Martine Labbé (Transp. Sci., 1998)

Two Simple Algorithms for bin Covering. - János Csirik; J. B. G. Frenk; Martine Labbé; Shuzhong Zhang (Acta Cybern., 1999)

The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut. - Corinne Feremans; Martine Labbé; Gilbert Laporte (Electron. Notes Discret. Math., 1999)

Finding Disjoint Routes in Telecommunications Networks with Two Technologies. - Anne de Jongh; Michel Gendreau; Martine Labbé (Oper. Res., 1999)

Locations on time-varying networks. - S. Louis Hakimi; Martine Labbé; Edward F. Schmeichel (Networks, 1999)

Multicriteria network location problems with sum objectives. - Horst W. Hamacher; Martine Labbé; Stefan Nickel (Networks, 1999)

Exact solution of the SONET Ring Loading Problem. - Mauro Dell'Amico; Martine Labbé; Francesco Maffioli (Oper. Res. Lett., 1999)

Recent advances in theory and practice of combinatorial optimization (ECCO X). - Rainer E. Burkard; Martine Labbé; M. Teresa Ramos; Joaquin Sicilia (Eur. J. Oper. Res., 2000)

Solving the Two-Connected Network with Bounded Meshes Problem. - Bernard Fortz; Martine Labbé; Francesco Maffioli (Oper. Res., 2000)

The Uncapacitated Facility Location Problem with Client Matching. - Éric Gourdin; Martine Labbé; Gilbert Laporte (Oper. Res., 2000)

A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem. - Luce Brotcorne; Martine Labbé; Patrice Marcotte; Gilles Savard (Transp. Sci., 2000)

Preface. - Martine Labbé; Gilbert Laporte; Silvano Martello (Discret. Appl. Math., 2001)

On generalized minimum spanning trees. - Corinne Feremans; Martine Labbé; Gilbert Laporte (Eur. J. Oper. Res., 2001)

Fishman's sampling plan for computing network reliability. - Eugène Manzi; Martine Labbé; Guy Latouche; Francesco Maffioli (IEEE Trans. Reliab., 2001)

A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network. - Luce Brotcorne; Martine Labbé; Patrice Marcotte; Gilles Savard (Transp. Sci., 2001)

Local optimization of index assignments for multiple description coding. - Jean Cardinal; Sourour Elloumi; Martine Labbé (EUSIPCO, 2002)

Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives. - Horst W. Hamacher; Martine Labbé; Stefan Nickel; Anders J. V. Skriver (Ann. Oper. Res., 2002)

Polyhedral results for two-connected networks with bounded rings. - Bernard Fortz; Martine Labbé (Math. Program., 2002)

A comparative analysis of several formulations for the generalized minimum spanning tree problem. - Corinne Feremans; Martine Labbé; Gilbert Laporte (Networks, 2002)

Generalized network design problems. - Corinne Feremans; Martine Labbé; Gilbert Laporte (Eur. J. Oper. Res., 2003)

Upper bounds and algorithms for the maximum cardinality bin packing problem. - Martine Labbé; Gilbert Laporte; Silvano Martello (Eur. J. Oper. Res., 2003)

Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. - Nenad Mladenovic; Martine Labbé; Pierre Hansen (Networks, 2003)

Two-Connected Networks with Rings of Bounded Cardinality. - Bernard Fortz; Martine Labbé (Comput. Optim. Appl., 2004)

Adapting polyhedral properties from facility to hub location problems. - Horst W. Hamacher; Martine Labbé; Stefan Nickel; Tim Sonneborn (Discret. Appl. Math., 2004)

A New Formulation and Resolution Method for the p-Center Problem. - Sourour Elloumi; Martine Labbé; Yves Pochet (INFORMS J. Comput., 2004)

A branch-and-cut algorithm for the plant-cycle location problem. - Martine Labbé; Inmaculada Rodríguez Martín; Juan José Salazar González (J. Oper. Res. Soc., 2004)

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. - Corinne Feremans; Martine Labbé; Gilbert Laporte (Networks, 2004)

The Ring Star Problem: Polyhedral analysis and exact algorithm. - Martine Labbé; Gilbert Laporte; Inmaculada Rodríguez Martín; Juan José Salazar González (Networks, 2004)

Projecting the flow variables for hub location problems. - Martine Labbé; Hande Yaman (Networks, 2004)

A Tight Analysis of the Maximal Matching Heuristic. - Jean Cardinal; Martine Labbé; Stefan Langerman; Eythan Levy; Hadrien Mélot (COCOON, 2005)

Locating median cycles in networks. - Martine Labbé; Gilbert Laporte; Inmaculada Rodríguez Martín; Juan José Salazar González (Eur. J. Oper. Res., 2005)

A branch and cut algorithm for hub location problems with single assignment. - Martine Labbé; Hande Yaman; Éric Gourdin (Math. Program., 2005)

Polyhedral Approaches to the Design of Survivable Networks. - Bernard Fortz; Martine Labbé (Handbook of Optimization in Telecommunications, 2006)

Bilevel Programming and Price Setting Problems. - Martine Labbé (OR, 2006)

Preface. - Martine Labbé; José Pinto Paixão; Maria Grazia Speranza (Ann. Oper. Res., 2006)

Polyhedral Analysis for Concentrator Location Problems. - Martine Labbé; Hande Yaman (Comput. Optim. Appl., 2006)

On a network pricing problem with consecutive toll arcs. - Géraldine Heilporn; Martine Labbé; Patrice Marcotte; Gilles Savard (CTW, 2007)

A branch-and-cut method for the obnoxious p -median problem. - Pietro Belotti; Martine Labbé; Francesco Maffioli; Malick M. Ndiaye (4OR, 2007)

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. - David Huygens; Martine Labbé; Ali Ridha Mahjoub; Pierre Pesneau (Networks, 2007)

A strengthened formulation for the simple plant location problem with order. - Lázaro Cánovas; Sergio García 001; Martine Labbé; Alfredo Marín 001 (Oper. Res. Lett., 2007)

Solving haplotyping inference parsimony problem using a new basic polynomial formulation. - Paola Bertolazzi; Alessandra Godi; Martine Labbé; Leonardo Tininini (Comput. Math. Appl., 2008)

Optimization models for the single delay management problem in public transportation. - Géraldine Heilporn; Luigi De Giovanni; Martine Labbé (Eur. J. Oper. Res., 2008)

Joint Design and Pricing on a Network. - Luce Brotcorne; Martine Labbé; Patrice Marcotte; Gilles Savard (Oper. Res., 2008)

Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. - Julie Christophe; Sophie Dewez; Jean-Paul Doignon; Gilles Fasbender; Philippe Grégoire; David Huygens; Martine Labbé; Sourour Elloumi; Hadrien Mélot; Hande Yaman (Networks, 2008)

Solving the hub location problem in a star-star network. - Martine Labbé; Hande Yaman (Networks, 2008)

New formulations and valid inequalities for a bilevel pricing problem. - Sophie Dewez; Martine Labbé; Patrice Marcotte; Gilles Savard (Oper. Res. Lett., 2008)

Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. - Pierre Hansen; Martine Labbé; David Schindl (Discret. Optim., 2009)

Pricing Geometric Transportation Networks. - Jean Cardinal; Martine Labbé; Stefan Langerman; Belén Palop (Int. J. Comput. Geom. Appl., 2009)

The pure parsimony haplotyping problem: overview and computational advances. - Daniele Catanzaro; Martine Labbé (Int. Trans. Oper. Res., 2009)

Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. - Daniele Catanzaro; Martine Labbé; Raffaele Pesenti; Juan José Salazar González (Networks, 2009)

Generating Facets for the Independence System Polytope. - Pierre Fouilhoux; Martine Labbé; Ali Ridha Mahjoub; Hande Yaman (SIAM J. Discret. Math., 2009)

Size-constrained graph partitioning polytopes. - Martine Labbé; F. Aykut Özsoy (Discret. Math., 2010)

A Class Representative Model for Pure Parsimony Haplotyping. - Daniele Catanzaro; Alessandra Godi; Martine Labbé (INFORMS J. Comput., 2010)

A polyhedral study of the network pricing problem with connected toll arcs. - Géraldine Heilporn; Martine Labbé; Patrice Marcotte; Gilles Savard (Networks, 2010)

Improved Formulations for the Ring Spur Assignment Problem. - Paula Carroll; Bernard Fortz; Martine Labbé; Seán McGarraghy (INOC, 2011)

A branch-and-cut algorithm for the partitioning-hub location-routing problem. - Daniele Catanzaro; Éric Gourdin; Martine Labbé; F. Aykut Özsoy (Comput. Oper. Res., 2011)

Reduction approaches for robust shortest path problems. - Daniele Catanzaro; Martine Labbé; Martha Salazar-Neumann (Comput. Oper. Res., 2011)

An exact approach to the problem of extracting an embedded network matrix. - Rosa M. V. Figueiredo; Martine Labbé; Cid C. de Souza (Comput. Oper. Res., 2011)

Valid inequalities and branch-and-cut for the clique pricing problem. - Géraldine Heilporn; Martine Labbé; Patrice Marcotte; Gilles Savard (Discret. Optim., 2011)

Solving Large p-Median Problems with a Radius Formulation. - Sergio García 001; Martine Labbé; Alfredo Marín 001 (INFORMS J. Comput., 2011)

Scheduling two chains of unit jobs on one machine: A polyhedral study. - Claudio Arbib; Martine Labbé; Mara Servilio (Networks, 2011)

Generalized network design polyhedra. - Corinne Feremans; Martine Labbé; Adam N. Letchford; Juan José Salazar González (Networks, 2011)

A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem. - Daniele Catanzaro; Martine Labbé; Bjarni V. Halldórsson (ISBRA, 2012)

The Balanced Minimum Evolution Problem. - Daniele Catanzaro; Martine Labbé; Raffaele Pesenti; Juan José Salazar González (INFORMS J. Comput., 2012)

Solution of the Maximum $$k$$ k -Balanced Subgraph Problem. - Rosa M. V. Figueiredo; Yuri Frota; Martine Labbé (LION, 2013)

Bilevel programming and price setting problems. - Martine Labbé; Alessia Violin (4OR, 2013)

The balanced minimum evolution problem under uncertain data. - Daniele Catanzaro; Martine Labbé; Raffaele Pesenti (Discret. Appl. Math., 2013)

Editorial. - Martine Labbé; M. Grazia Speranza (EURO J. Comput. Optim., 2013)

Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs. - Bernard Fortz; Martine Labbé; Alessia Violin (Electron. Notes Discret. Math., 2013)

Stochastic binary problems with simple penalties for capacity constraints violations. - Bernard Fortz; Martine Labbé; François V. Louveaux; Michael Poss (Math. Program., 2013)

A branch-and-cut algorithm for the ring spur assignment problem. - Paula Carroll; Bernard Fortz; Martine Labbé; Seán McGarraghy (Networks, 2013)

An Integer Programming Formulation of the Parsimonious Loss of Heterozygosity Problem. - Daniele Catanzaro; Martine Labbé; Bjarni V. Halldórsson (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Feature selection for Support Vector Machines via Mixed Integer Linear Programming. - Sebastián Maldonado; Juan Pérez; Richard Weber 002; Martine Labbé (Inf. Sci., 2014)

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem. - Daniele Catanzaro; Luis Eduardo Neves Gouveia; Martine Labbé (Eur. J. Oper. Res., 2015)

A branch-cut-and-price algorithm for the piecewise linear transportation problem. - Tue Rauff Lind Christensen; Martine Labbé (Eur. J. Oper. Res., 2015)

A Column Generation Approach for Pure Parsimony Haplotyping. - Veronica Dal Sasso; Luigi De Giovanni; Martine Labbé (SCOR, 2016)

A branch and price algorithm for a Stackelberg Security Game. - Felipe Lagos; Fernando Ordóñez; Martine Labbé (Comput. Ind. Eng., 2017)

Lagrangian relaxation for SVM feature selection. - Manlio Gaudioso; Enrico Gorgone; Martine Labbé; Antonio M. Rodríguez-Chía (Comput. Oper. Res., 2017)

A comparative study of formulations and solution methods for the discrete ordered p-median problem. - Martine Labbé; Diego Ponce; Justo Puerto (Comput. Oper. Res., 2017)

Network pricing problem with unit toll. - Lorenzo Castelli; Martine Labbé; Alessia Violin (Networks, 2017)

Discussion of Fairness and Implementability in Stackelberg Security Games. - Victor Bucarey; Martine Labbé (GameSec, 2019)

The rank pricing problem: Models and branch-and-cut algorithms. - Herminia I. Calvete; Concepción Domínguez; Carmen Galé; Martine Labbé; Alfredo Marín 001 (Comput. Oper. Res., 2019)

New models for the location of controversial facilities: A bilevel programming approach. - Martine Labbé; Marina Leal; Justo Puerto (Comput. Oper. Res., 2019)

A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph. - Rosa Figueiredo 001; Yuri Frota; Martine Labbé (Discret. Appl. Math., 2019)

Mixed integer linear programming for feature selection in support vector machine. - Martine Labbé; Luisa I. Martínez-Merino; Antonio M. Rodríguez-Chía (Discret. Appl. Math., 2019)

The Geodesic Classification Problem on Graphs. - Paulo Henrique Macêdo de Araújo; Manoel B. Campêlo; Ricardo C. Corrêa; Martine Labbé (LAGOS, 2019)

A study of general and security Stackelberg game formulations. - Carlos Casorrán; Bernard Fortz; Martine Labbé; Fernando Ordóñez (Eur. J. Oper. Res., 2019)

Strengthened Formulations and Valid Inequalities for Single Delay Management in Public Transportation. - Veronica Dal Sasso; Luigi De Giovanni; Martine Labbé (Transp. Sci., 2019)

Special issue on bilevel optimization. - Luce Brotcorne; Bernard Fortz; Martine Labbé (EURO J. Comput. Optim., 2020)

A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem. - Samuel Deleplanque; Martine Labbé; Diego Ponce; Justo Puerto (INFORMS J. Comput., 2020)

Technical Note - There's No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization. - Thomas Kleinert; Martine Labbé; Fränk Plein; Martin Schmidt 003 (Oper. Res., 2020)

Models and algorithms for the product pricing with single-minded customers requesting bundles. - Victor Bucarey; Sourour Elloumi; Martine Labbé; Fränk Plein (Comput. Oper. Res., 2021)

A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. - Thomas Kleinert; Martine Labbé; Ivana Ljubic; Martin Schmidt 003 (EURO J. Comput. Optim., 2021)

Coordinating resources in Stackelberg Security Games. - Victor Bucarey; Carlos Casorrán; Martine Labbé; Fernando Ordóñez; Óscar Figueroa (Eur. J. Oper. Res., 2021)

The rank pricing problem with ties. - Concepción Domínguez; Martine Labbé; Alfredo Marín 001 (Eur. J. Oper. Res., 2021)

Finding the root graph through minimum edge deletion. - Martine Labbé; Alfredo Marín 001; Mercedes Pelegrín (Eur. J. Oper. Res., 2021)

Computational comparisons of different formulations for the Stackelberg minimum spanning tree game. - Martine Labbé; Miguel A. Pozo 001; Justo Puerto (Int. Trans. Oper. Res., 2021)

Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks. - Martine Labbé; Fränk Plein; Martin Schmidt 003; Johannes Thürauf (Networks, 2021)

Closing the gap in linear bilevel optimization: a new valid primal-dual inequality. - Thomas Kleinert; Martine Labbé; Fränk Plein; Martin Schmidt 003 (Optim. Lett., 2021)

Benders decomposition for network design covering problems. - Víctor Bucarey; Bernard Fortz; Natividad González-Blanco; Martine Labbé; Juan A. Mesa (Comput. Oper. Res., 2022)

Product line optimization with multiples sites. - Sebastián Dávila-Gálvez; Martine Labbé; Vladimir Marianov; Fernando Ordóñez; Frédéric Semet (Comput. Oper. Res., 2022)

Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy. - Concepción Domínguez; Martine Labbé; Alfredo Marín 001 (Comput. Oper. Res., 2022)

Multi-market portfolio optimization with conditional value at risk. - Stefano Nasini; Martine Labbé; Luce Brotcorne (Eur. J. Oper. Res., 2022)

Support Vector Machine with feature selection: A multiobjective approach. - Javier Alcaraz; Martine Labbé; Mercedes Landete (Expert Syst. Appl., 2022)

A bilevel optimization approach to decide the feasibility of bookings in the European gas market. - Fränk Plein; Johannes Thürauf; Martine Labbé; Martin Schmidt 003 (Math. Methods Oper. Res., 2022)

Dendrograms, minimum spanning trees and feature selection. - Martine Labbé; Mercedes Landete; Marina Leal (Eur. J. Oper. Res., 2023)

Branch-and-price with novel cuts, and a new Stackelberg Security Game. - Pamela Bustamante-Faúndez; Víctor Bucarey López; Martine Labbé; Vladimir Marianov; Fernando Ordóñez (CoRR, 2024)

Integer programming models and polyhedral study for the geodesic classification problem on graphs. - Paulo Henrique Macêdo de Araújo; Manoel B. Campêlo; Ricardo C. Corrêa; Martine Labbé (Eur. J. Oper. Res., 2024)

Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems. - Diego Cattaruzza; Martine Labbé; Matteo Petris; Marius Roland; Martin Schmidt 003 (INFORMS J. Comput., 2024)

Bidding in day-ahead electricity markets: A dynamic programming framework. - Jérôme De Boeck; Bernard Fortz; Martine Labbé; Étienne Marcotte; Patrice Marcotte; Gilles Savard (Comput. Oper. Res., 2025)

Novel valid inequalities and branch-and-price for Stackelberg security games. - Pamela Bustamante-Faúndez; Víctor Bucarey López; Martine Labbé; Vladimir Marianov; Fernando Ordóñez (Comput. Oper. Res., 2025)

A mixed-integer optimization formulation for buyer formation. - Sebastián Dávila-Gálvez; Martine Labbé; Vladimir Marianov; Fernando Ordóñez; Frédéric Semet (Comput. Oper. Res., 2025)

On λ-cent-dians and generalized-center for network design: definitions and properties. - Víctor Bucarey; Natividad González-Blanco; Martine Labbé; Juan A. Mesa (Ann. Oper. Res., 2025)

On λ-cent-dians and generalized-center for network design: formulations and algorithms. - Víctor Bucarey; Natividad González-Blanco; Martine Labbé; Juan A. Mesa (Ann. Oper. Res., 2025)