Martine Labbé | Academic Influence

Martine Labbé's AcademicInfluence.com Rankings

Martine Labbé

Mathematics

#7424

World Rank

#10097

Historical Rank

Operations Research

#84

World Rank

#86

Historical Rank

Graph Theory

#105

World Rank

#113

Historical Rank

Measure Theory

#2609

World Rank

#3123

Historical Rank

mathematics Degrees

Martine Labbé

Computer Science

#10246

World Rank

#10742

Historical Rank

Programming

#99

World Rank

#103

Historical Rank

computer-science Degrees

Download Badge

Mathematics
Computer Science

Martine Labbé's Degrees

PhD Operations Research Université Paris Cité
Bachelors Computer Science Université de Montréal

Similar Degrees You Can Earn

Why Is Martine Labbé Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Martine Labbé is a Belgian operations researcher known for her work on mathematical optimization, facility location, and road pricing. She is an honorary professor of graphs and mathematical optimization in the department of computer science at the Université libre de Bruxelles, editor-in-chief of the EURO Journal on Computational Optimization, and a former president of the Association of European Operational Research Societies .

(See a Problem?)

Martine Labbé's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A bilevel model of taxation and its application to optimal highway pricing (1996) (373)
Location on networks (1992) (210)
A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network (2000) (193)
Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search (2000) (181)
The Ring Star Problem: Polyhedral analysis and exact algorithm (2004) (176)
A branch and cut algorithm for hub location problems with single assignment (2005) (158)
A New Formulation and Resolution Method for the p-Center Problem (2004) (151)
Solving Large p-Median Problems with a Radius Formulation (2011) (146)
Design of survivable networks (2006) (145)
Adapting polyhedral properties from facility to hub location problems (2004) (140)
Capacitated Vehicle Routing on Trees (1991) (113)
Bilevel programming and price setting problems (2013) (105)
Generalized network design problems (2003) (103)
On the Two-Level Uncapacitated Facility Location Problem (1996) (99)
A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem (2000) (94)
Locating median cycles in networks (2005) (94)
Identification of all steady states in large networks by logical analysis (2003) (82)
On locating path- or tree-shaped facilities on networks (1993) (82)
Maximizing user convenience and postal service efficiency in post box location (1986) (82)
Market and Locational Equilibrium for Two Competitors (1991) (80)
Joint Design and Pricing on a Network (2002) (78)
Feature selection for Support Vector Machines via Mixed Integer Linear Programming (2014) (78)
Telecommunication and location (2002) (75)
Projecting the flow variables for hub location problems (2004) (75)
A strengthened formulation for the simple plant location problem with order (2007) (74)
Optimization models for the single delay management problem in public transportation (2008) (72)
Solving the hub location problem in a star–star network (2008) (70)
Heuristic for the 0-1 Min-Knapsack Problem (1991) (68)
Fishman's sampling plan for computing network reliability (2001) (66)
A comparative analysis of several formulations for the generalized minimum spanning tree problem (2002) (66)
Operations Research and Decision Aid Methodologies in Traffic and Transportation Management (1998) (64)
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (2005) (61)
Solving the Two-Connected Network with Bounded Meshes Problem (2000) (59)
Sensitivity analysis in multiple objective linear programming: The tolerance approach (1989) (58)
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization (2021) (57)
New formulations and valid inequalities for a bilevel pricing problem (2008) (56)
Facility location analysis (1987) (55)
Sensitivity Analysis in Minisum Facility Location Problems (1991) (54)
Technical Note - There's No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (2019) (54)
A general model for the uncapacitated facility and depot location problem (1994) (54)
The Voronoi Partition of a Network and Its Implications in Location Theory (1992) (53)
A branch-and-cut algorithm for the partitioning-hub location-routing problem (2011) (53)
An exact algorithm for the dual bin packing problem (1995) (52)
p-Center Problems (2015) (47)
Upper bounds and algorithms for the maximum cardinality bin packing problem (2003) (46)
Algorithms for Voting and Competitive Location on a Network (1988) (46)
The Uncapacitated Facility Location Problem with Client Matching (2000) (44)
A branch-and-cut algorithm for the plant-cycle location problem (2004) (43)
Exact solution of the SONET Ring Loading Problem (1999) (43)
Commuters' Paths with Penalties for Early or Late Arrival Time (1990) (40)
Competitive Location with Random Utilities (1989) (40)
On the multidimensional vector bin packing (1990) (40)
Design and Dimensioning of Survivable SDH/Sonet Networks (1999) (40)
Outcomes of voting and planning in single facility location problems (1985) (40)
Multicriteria network location problems with sum objectives (1999) (39)
Reduction approaches for robust shortest path problems (2011) (38)
Lagrangian relaxation for SVM feature selection (2017) (38)
Path, Tree and Cycle Location (1998) (37)
The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm (2004) (37)
Bilevel programming and price setting problems (2016) (36)
On a class of bilevel programs (2000) (36)
A Network Pricing Formulation for the Revenue Maximization of European Air Navigation Service Providers (2013) (35)
Efficient heuristics for the design of ring networks (1995) (34)
A polyhedral study of the network pricing problem with connected toll arcs (2010) (34)
The two‐edge connected hop‐constrained network design problem: Valid inequalities and branch‐and‐cut (2007) (33)
Chapter 7 Location on networks (1995) (32)
Two-Dimensional Rectangle Packing: On-Line Methods and Results (1993) (31)
A branch-and-cut method for the obnoxious p-median problem (2007) (31)
Improved integer linear programming formulations for the job Sequencing and tool Switching Problem (2015) (30)
Single Facility Location on Networks (1987) (30)
Two Simple Algorithms for bin Covering (1999) (29)
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives (2002) (28)
A parallel between two classes of pricing problems in transportation and marketing (2010) (27)
Mixed Integer Linear Programming for Feature Selection in Support Vector Machine (2018) (27)
A Class Representative Model for Pure Parsimony Haplotyping (2010) (26)
From the Median To the Generalized Center (1990) (26)
Size-constrained graph partitioning polytopes (2010) (26)
Two-Connected Networks with Rings of Bounded Cardinality (2004) (25)
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (2007) (25)
Polyhedral results for two-connected networks with bounded rings (2002) (25)
A study of general and security Stackelberg game formulations (2019) (25)
A comparative study of formulations and solution methods for the discrete ordered p-median problem (2017) (24)
The Balanced Minimum Evolution Problem (2012) (24)
Solving haplotyping inference parsimony problem using a new basic polynomial formulation (2008) (23)
The pure parsimony haplotyping problem: overview and computational advances (2009) (23)
A Lower Bound for the Internet Protocol Network Design Problem (2005) (23)
On the Toll Setting Problem (2010) (22)
Improved Algorithms for Machine Allocation in Manufacturing Systems (1994) (21)
On the existence of price equilibria under mill and uniform delivered price policies (1986) (21)
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships (2008) (20)
Network Synthesis with Non-Simultaneous Multicommodity Flow Requirements: Bounds and Heuristics (1999) (20)
On the welfare effects of anti-discrimination regulations in the EC car market (1989) (20)
How bad can a voting location be (1986) (18)
A Tight Analysis of the Maximal Matching Heuristic (2005) (18)
The multi-level uncapacitated facility location problem is not submodular (1993) (18)
Polyhedral Analysis for Concentrator Location Problems (2006) (17)
Pricing of Geometric Transportation Networks (2009) (17)
Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem (2000) (17)
Stochastic binary problems with simple penalties for capacity constraints violations (2013) (16)
Bookings in the European gas market: characterisation of feasibility and computational complexity results (2020) (16)
Happy Anniversary (1962) (16)
Transportaion planning : state of the art (2010) (16)
An exact approach to the problem of extracting an embedded network matrix (2011) (15)
On generalized minimum spanning trees (2001) (15)
Location of an obnoxious facility on a network: A voting approach (1990) (15)
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (2020) (14)
Finding Disjoint Routes in Telecommunications Networks with Two Technologies (1999) (14)
Valid inequalities and branch-and-cut for the clique pricing problem (2011) (14)
The Median Cycle Problem (2001) (13)
New models for the location of controversial facilities: A bilevel programming approach (2019) (13)
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion (2008) (13)
A branch‐and‐cut algorithm for the ring spur assignment problem (2013) (13)
Locations on time‐varying networks (1999) (12)
Facility Location: Models, Methods and Applications (1998) (12)
The continuous center set of a network (1991) (12)
The continuous p-median of a network (1989) (11)
Covering a graph with cycles (1998) (9)
Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks (2020) (9)
Support Vector Machine with feature selection: A multiobjective approach (2022) (9)
Approximation algorithms for the capacitated plant allocation problem (1994) (9)
Locations on time-varying networks (1999) (9)
Coordinating resources in Stackelberg Security Games (2019) (8)
The Geodesic Classification Problem on Graphs (2019) (8)
A Dynamic User Equilibrium Model for Traffic Assignment in Urban Areas (2002) (8)
Complexity of spanning tree problems with leaf-dependent objectives (1996) (8)
The Knapsack Problem With Gaussian Weights ? (7)
Generating Facets for the Independence System Polytope (2009) (7)
Locations on networks (1995) (7)
Polyhedral Approaches to the Design of Survivable Networks (2006) (7)
Computer-aided human leukocyte antigen association studies: a case study for psoriasis and severe alopecia areata. (2010) (7)
A branch and price algorithm for a Stackelberg Security Game (2017) (7)
Essays in network location theory (1985) (7)
Models and algorithms for the product pricing with single-minded customers requesting bundles (2021) (6)
A market regulation bilevel problem: A case study of the Mexican petrochemical industry (2020) (6)
Improved Formulations for the Ring Spur Assignment Problem (2011) (6)
A tabu search heuristic for the design of two-connected networks with bounded rings (2002) (6)
The rank pricing problem: Models and branch-and-cut algorithms (2019) (6)
A bilevel optimization approach to decide the feasibility of bookings in the European gas market (2021) (5)
The p-center sum location problem (1994) (5)
Computational comparisons of different formulations for the Stackelberg minimum spanning tree game (2021) (5)
Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut (2005) (5)
NEW FORMULATIONS AND VALID INEQUALITIES FOR THE TOLL SETTING PROBLEM (2006) (5)
Methods for designing reliable networks with bounded meshes (1997) (5)
Annotated Bibliography on Location Problems (1997) (5)
Optimization in Transportation (2006) (5)
A branch-cut-and-price algorithm for the piecewise linear transportation problem (2015) (5)
An Integer Programming Formulation of the Parsimonious Loss of Heterozygosity Problem (2013) (5)
Scheduling two chains of unit jobs on one machine: A polyhedral study (2011) (4)
Facility location analysis: theory and applications (1989) (4)
Polyhedral Analysis of the Generalized Minimum Spanning Tree Problem (1999) (4)
A Polyhedral Study for Delay Management in Public Transportation (2014) (4)
A branch-and-cut-and-price framework for convex MINLP applied to a stochastic network design problem (2010) (4)
Recent advances in theory and practice of combinatorial optimization (ECCO X) (2000) (4)
Network pricing problem with unit toll (2017) (4)
ECCO X: advances in theory and practice of combinatorial optimization (2000) (4)
Advances in robust combinatorial optimization and linear programming (2010) (3)
Obnoxious p-Median problems : valid inequalities and a Branch-and-Cut approach (2001) (3)
Innovation and Industrial Development in Africa (2012) (3)
En route charges for ANSP revenue maximization (2010) (3)
Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs (2013) (3)
Size-constrained graph partitioning polytope. Part I: Dimension and trivial facets (2007) (2)
Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy (2022) (2)
Fast algorithms for dual bin packing (1990) (2)
A note on a stochastic location problem (1993) (2)
The balanced minimum evolution problem under uncertain data (2013) (2)
The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut (1999) (2)
Complexity of Spanning Tree Problems with Leaf-Dependant Objective Function (1996) (2)
The median location problem with continuous demand (1992) (2)
Load Scheduling for Residential Demand Response on Smart Grids (2017) (2)
A Column Generation Approach for Pure Parsimony Haplotyping (2016) (2)
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126] (1996) (2)
A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph (2019) (2)
Fare inspection patrols scheduling in transit systems using a Stackelberg game approach (2021) (2)
A Parallel Between Two Classes of Pricing Problems in Transportation and Economics (2009) (2)
Trade Governance in the Digital Age: Harnessing information and communication technologies for development (2012) (2)
Generalized network design polyhedra (2011) (2)
Strengthened Formulations and Valid Inequalities for Single Delay Management in Public Transportation (2019) (2)
Size-constrained graph partitioning polytope . Part II : Non-trivial facets (2007) (2)
Annals of Operations Research: Preface (2006) (1)
Optimal location: minimum versus equilibrium allocation (1987) (1)
Product line optimization with multiples sites (2022) (1)
Coordinated defender strategies for border patrols (2018) (1)
Bioinformatics Research and Applications (2012) (1)
A Class Representative Model for Pure Parsimony Haplotyping under Uncertain Data (2011) (1)
Viewpoints on optimization (1994) (1)
Bilevel Network Design (2021) (1)
Design dimensioning of survivable SDH networks (1999) (1)
On a network pricing problem with consecutive toll arcs (2007) (1)
SATURN D2.1 - Future airspace congestion - a users' discussion guide (2014) (1)
Finding the root graph through minimum edge deletion (2021) (1)
Operations research in traffic and transportation management (1998) (1)
The Generalized Subgraph Problem: Complexity, Approximability and Polyhedra (2003) (1)
Solution of the Maximum $$k$$ k -Balanced Subgraph Problem (2013) (1)
An Integer Programming Formulation of the Parsimonious Loss of Heterozygosity Problem. (2012) (1)
Analysis of a Problem in Product Pricing, Mathematics (2017) (1)
A Mixed-Integer Optimization Formulation for Buyers Formation (2023) (1)
The rank pricing problem with ties (2021) (1)
Combinatorial optimization symposium (2001) (1)
Bookings in the European gas market: characterisation of feasibility and computational complexity results (2019) (1)
Models and methods for molecular phylogenetics (2008) (0)
Mathematical modelling of telecommunication networks (1994) (0)
Integer Programming Models for the Geodesic Classification Problem on Graphs (2022) (0)
An Integer Programming Formulation of the Parsimonious Loss of Heterozygosity Problem. (2012) (0)
A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem (2012) (0)
Bilevel optimisation, Stackelberg games and pricing problems (2019) (0)
How combinatorial optimization can help solving problems in biology: the example of haplotyping (2009) (0)
Comments on: Static and dynamic source locations in undirected networks (2015) (0)
9 DESIGN AND DIMENSIONING (1999) (0)
THE ECONOMIC CLIMATE OF 1988 (1988) (0)
Bilevel optimisation and pricing problems (2019) (0)
Bilevel programming models for multi-product location problems (2019) (0)
INTERNATIONAL SCHOOL OF MATHEMATICS «GUIDO STAMPACCHIA» 56th Workshop: GRAPH THEORY, ALGORITHMS AND APPLICATIONS (2008) (0)
UNCAPACITATED FACILITY LOCATION WITH ALLOCATION OF MATCHED AND UNMATCHED CLIENTS (1997) (0)
Comments on: Static and dynamic source locations in undirected networks (2015) (0)
Stackelberg games and bilevel bilinear optimisation (2017) (0)
Special issue on bilevel optimization (2020) (0)
Bilevel programming, Stackelberg games and pricing problems (2019) (0)
LAYOUT OF THE GRADE SEPARATED INTERCHANGE ON THE RN13-RN186-CD7 MOTORWAY TO PECQ AND AT PORT MARLY - DESIGN AND SPECIAL FEATURES (1976) (0)
Bilevel programming and price setting problems (2012) (0)
Transport aircraft loading and balancing system: Using a CLIPS expert system for military aircraft load planning (1994) (0)
Pareto Locations on Networks (1998) (0)
An integer programming approach to layer planning in communication networks (2011) (0)
Design of survivable networks with bounded-length paths (2005) (0)
Novel formulations for general and security Stackelberg games (2016) (0)
The Generalized Subgraph Problem : Valid inequalities and separation (2005) (0)
Operations Research Proceedings 2018, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Brussels, Belgium, September 12-14, 2018 (2019) (0)
SATURN D4.2 - Pure Pricing Mechanisms (2015) (0)
Stackelberg games and bilevel bilinear optimization problem (2017) (0)
Lexicographical Order in Integer Programming (2017) (0)
Discussion of Fairness and Implementability in Stackelberg Security Games (2019) (0)
TSS Dissertation Abstracts - Abstracts for the 1997 Transportation Science Section Dissertation Prize Competition (1998) (0)
An exact algorithm for a location-routing problem (2003) (0)
TAKING THE ECONOMIC PULSE (1987) (0)
Exact and Heuristic Solution Techniqes for Mixed-Integer antile Minimization Problems (2021) (0)
The loss of heterozigosity problem (2012) (0)
A tree-network has the fixed point property (1989) (0)
Stochastic binary problems with simple penalties for capacity constraints violations (2012) (0)
Dynamic programming approach for bidding problems on day-ahead markets (2018) (0)
EURO Gold Medal Laureate Lecture (2019) (0)
Lexicographical Order in Integer Programming (2016) (0)
Editorial (2013) (0)
Sensitivity analysis in minisum location problems (1991) (0)
Theoretical and computational comparisons of formulations for Stackelberg bimatrix games (2017) (0)
L'AMENAGEMENT DU CARREFOUR A NIVEAUX SEPARES RN 13 - RN 186 - CD 7 AU PECQ ET A PORT-MARLY - CONCEPTION ET PARTICULARITES DE REALISATION (1976) (0)
Bilevel integer linear models for ranking items and sets (2023) (0)
Local optimization of index assignments for multiple description coding (2002) (0)
Combinatorial Optimization and Applications (2011) (0)
Optmization in transportation (2006) (0)
Mathematical models for HLA association studies: A case study for psoriasis and severe alopecia areata (2009) (0)
Competitive Location Theory under Consumers’ Probabilistic Choices (1986) (0)
Preface (2001) (0)
ECONOMIC OUTLOOK WITH AN EYE ON LTL TRUCKING. (1993) (0)
Preface (2006) (0)
Dendrograms, minimum spanning trees and feature selection (2022) (0)
Bilevel programming and price setting problems (2015) (0)
Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems (2022) (0)
FROM THE MEDIAN TO THE GEWERALIZED CENTER ( * ) (2017) (0)
WEIGHTED CLIQUES APPLIED TO BIOLOGICAL NETWORKS Luis Gouveia Pedro Martins MATHEMATICAL PROGRAMMING APPROACHES FOR THE COMPARISON OF 3 D PROTEIN STRUCTURES (2012) (0)
Ranking Items and Sets (2022) (0)
The Network Pricing Problem with congestion (2014) (0)
Bilevel programming and price optimization problems (2019) (0)

This paper list is powered by the following services:

Other Resources About Martine Labbé

en.wikipedia.org

What Schools Are Affiliated With Martine Labbé?

Martine Labbé is affiliated with the following schools: