Martine Labbé

According to our database1, Martine Labbé authored at least 112 papers between 1988 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 





Mixed integer linear programming for feature selection in support vector machine.
Discrete Applied Mathematics, 2019

A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph.
Discrete Applied Mathematics, 2019

New models for the location of controversial facilities: A bilevel programming approach.
Computers & OR, 2019

The rank pricing problem: Models and branch-and-cut algorithms.
Computers & OR, 2019

Mixed Integer Linear Programming for Feature Selection in Support Vector Machine.
CoRR, 2018

Network pricing problem with unit toll.
Networks, 2017

A comparative study of formulations and solution methods for the discrete ordered p-median problem.
Computers & OR, 2017

Lagrangian relaxation for SVM feature selection.
Computers & OR, 2017

A branch and price algorithm for a Stackelberg Security Game.
Computers & Industrial Engineering, 2017

Bilevel programming and price setting problems.
Annals OR, 2016

A Column Generation Approach for Pure Parsimony Haplotyping.
Proceedings of the 5th Student Conference on Operational Research, 2016

A branch-cut-and-price algorithm for the piecewise linear transportation problem.
European Journal of Operational Research, 2015

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem.
European Journal of Operational Research, 2015

Feature selection for Support Vector Machines via Mixed Integer Linear Programming.
Inf. Sci., 2014

An Integer Programming Formulation of the Parsimonious Loss of Heterozygosity Problem.
IEEE/ACM Trans. Comput. Biology Bioinform., 2013

A branch-and-cut algorithm for the ring spur assignment problem.
Networks, 2013

Stochastic binary problems with simple penalties for capacity constraints violations.
Math. Program., 2013

Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs.
Electronic Notes in Discrete Mathematics, 2013

EURO J. Computational Optimization, 2013

The balanced minimum evolution problem under uncertain data.
Discrete Applied Mathematics, 2013

Bilevel programming and price setting problems.
4OR, 2013

Solution of the Maximum $$k$$ k -Balanced Subgraph Problem.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

The Balanced Minimum Evolution Problem.
INFORMS Journal on Computing, 2012

A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

Generalized network design polyhedra.
Networks, 2011

Scheduling two chains of unit jobs on one machine: A polyhedral study.
Networks, 2011

Solving Large p-Median Problems with a Radius Formulation.
INFORMS Journal on Computing, 2011

Valid inequalities and branch-and-cut for the clique pricing problem.
Discrete Optimization, 2011

An exact approach to the problem of extracting an embedded network matrix.
Computers & OR, 2011

Reduction approaches for robust shortest path problems.
Computers & OR, 2011

A branch-and-cut algorithm for the partitioning-hub location-routing problem.
Computers & OR, 2011

Improved Formulations for the Ring Spur Assignment Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

A polyhedral study of the network pricing problem with connected toll arcs.
Networks, 2010

A Class Representative Model for Pure Parsimony Haplotyping.
INFORMS Journal on Computing, 2010

Size-constrained graph partitioning polytopes.
Discrete Mathematics, 2010

Generating Facets for the Independence System Polytope.
SIAM J. Discrete Math., 2009

Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion.
Networks, 2009

The pure parsimony haplotyping problem: overview and computational advances.
ITOR, 2009

Pricing Geometric Transportation Networks.
Int. J. Comput. Geometry Appl., 2009

Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results.
Discrete Optimization, 2009

New formulations and valid inequalities for a bilevel pricing problem.
Oper. Res. Lett., 2008

Solving the hub location problem in a star-star network.
Networks, 2008

Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships.
Networks, 2008

Joint Design and Pricing on a Network.
Operations Research, 2008

Optimization models for the single delay management problem in public transportation.
European Journal of Operational Research, 2008

Solving haplotyping inference parsimony problem using a new basic polynomial formulation.
Computers & Mathematics with Applications, 2008

A strengthened formulation for the simple plant location problem with order.
Oper. Res. Lett., 2007

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut.
Networks, 2007

A branch-and-cut method for the obnoxious p -median problem.
4OR, 2007

On a network pricing problem with consecutive toll arcs.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

Polyhedral Analysis for Concentrator Location Problems.
Comp. Opt. and Appl., 2006

Annals OR, 2006

Bilevel Programming and Price Setting Problems.
Proceedings of the Operations Research, 2006

Polyhedral Approaches to the Design of Survivable Networks.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

A branch and cut algorithm for hub location problems with single assignment.
Math. Program., 2005

Locating median cycles in networks.
European Journal of Operational Research, 2005

A Tight Analysis of the Maximal Matching Heuristic.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Pricing of Geometric Transportation Networks.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Projecting the flow variables for hub location problems.
Networks, 2004

The Ring Star Problem: Polyhedral analysis and exact algorithm.
Networks, 2004

The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm.
Networks, 2004

A branch-and-cut algorithm for the plant-cycle location problem.
JORS, 2004

A New Formulation and Resolution Method for the p-Center Problem.
INFORMS Journal on Computing, 2004

Adapting polyhedral properties from facility to hub location problems.
Discrete Applied Mathematics, 2004

Two-Connected Networks with Rings of Bounded Cardinality.
Comp. Opt. and Appl., 2004

Solving the p-Center problem with Tabu Search and Variable Neighborhood Search.
Networks, 2003

Upper bounds and algorithms for the maximum cardinality bin packing problem.
European Journal of Operational Research, 2003

Generalized network design problems.
European Journal of Operational Research, 2003

A comparative analysis of several formulations for the generalized minimum spanning tree problem.
Networks, 2002

Polyhedral results for two-connected networks with bounded rings.
Math. Program., 2002

Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives.
Annals OR, 2002

Local optimization of index assignments for multiple description coding.
Proceedings of the 11th European Signal Processing Conference, 2002

A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network.
Transportation Science, 2001

Fishman's sampling plan for computing network reliability.
IEEE Trans. Reliability, 2001

On generalized minimum spanning trees.
European Journal of Operational Research, 2001

Discrete Applied Mathematics, 2001

A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem.
Transportation Science, 2000

The Uncapacitated Facility Location Problem with Client Matching.
Operations Research, 2000

Solving the Two-Connected Network with Bounded Meshes Problem.
Operations Research, 2000

Recent advances in theory and practice of combinatorial optimization (ECCO X).
European Journal of Operational Research, 2000

Exact solution of the SONET Ring Loading Problem.
Oper. Res. Lett., 1999

Multicriteria network location problems with sum objectives.
Networks, 1999

Locations on time-varying networks.
Networks, 1999

Finding Disjoint Routes in Telecommunications Networks with Two Technologies.
Operations Research, 1999

The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut.
Electronic Notes in Discrete Mathematics, 1999

Two Simple Algorithms for bin Covering.
Acta Cybern., 1999

TSS Dissertation Abstracts - Abstracts for the 1997 Transportation Science Section Dissertation Prize Competition.
Transportation Science, 1998

Covering a graph with cycles.
Computers & OR, 1998

Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126].
Oper. Res. Lett., 1996

Complexity of spanning tree problems with leaf-dependent objectives.
Networks, 1996

On the Two-Level Uncapacitated Facility Location Problem.
INFORMS Journal on Computing, 1996

Efficient heuristics for the design of ring networks.
Telecommunication Systems, 1995

An exact algorithm for the dual bin packing problem.
Oper. Res. Lett., 1995

Approximation algorithms for the capacitated plant allocation problem.
Oper. Res. Lett., 1994

Improved Algorithms for Machine Allocation in Manufacturing Systems.
Operations Research, 1994

A note on a stochastic location problem.
Oper. Res. Lett., 1993

On locating path- or tree-shaped facilities on networks.
Networks, 1993

Two-Dimensional Rectangle Packing: On-Line Methods and Results.
Discrete Applied Mathematics, 1993

The Voronoi Partition of a Network and Its Implications in Location Theory.
INFORMS Journal on Computing, 1992

Sensitivity Analysis in Minisum Facility Location Problems.
Operations Research, 1991

Capacitated Vehicle Routing on Trees.
Operations Research, 1991

Market and Locational Equilibrium for Two Competitors.
Operations Research, 1991

The continuous center set of a network.
Discrete Applied Mathematics, 1991

Heuristic for the 0-1 Min-Knapsack Problem.
Acta Cybern., 1991

Commuters' Paths with Penalties for Early or Late Arrival Time.
Transportation Science, 1990

Bibliographic Section.
Transportation Science, 1990

Location of an obnoxious facility on a network: A voting approach.
Networks, 1990

On the multidimensional vector bin packing.
Acta Cybern., 1990

Competitive Location with Random Utilities.
Transportation Science, 1989

A tree-network has the fixed point property.
Networks, 1989

The continuous p-median of a network.
Networks, 1989

Algorithms for Voting and Competitive Location on a Network.
Transportation Science, 1988