Остановите войну!
for scientists:
default search action
Martine Labbé
Person information
- affiliation: Université libre de Bruxelles, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j121]Martine Labbé, Mercedes Landete, Marina Leal:
Dendrograms, minimum spanning trees and feature selection. Eur. J. Oper. Res. 308(2): 555-567 (2023) - 2022
- [j120]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: 105417 (2022) - [j119]Concepción Domínguez, Martine Labbé, Alfredo Marín:
Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy. Comput. Oper. Res. 140: 105664 (2022) - [j118]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: 105978 (2022) - [j117]Stefano Nasini, Martine Labbé, Luce Brotcorne:
Multi-market portfolio optimization with conditional value at risk. Eur. J. Oper. Res. 300(1): 350-365 (2022) - [j116]Javier Alcaraz, Martine Labbé, Mercedes Landete:
Support Vector Machine with feature selection: A multiobjective approach. Expert Syst. Appl. 204: 117485 (2022) - [j115]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): 409-449 (2022) - 2021
- [j114]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: 105139 (2021) - [j113]Thomas Kleinert, Martine Labbé, Ivana Ljubic, Martin Schmidt:
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. EURO J. Comput. Optim. 9: 100007 (2021) - [j112]Martine Labbé, Alfredo Marín, Mercedes Pelegrín:
Finding the root graph through minimum edge deletion. Eur. J. Oper. Res. 289(1): 59-74 (2021) - [j111]Victor Bucarey, Carlos Casorrán, Martine Labbé, Fernando Ordóñez, Óscar Figueroa:
Coordinating resources in Stackelberg Security Games. Eur. J. Oper. Res. 291(3): 846-861 (2021) - [j110]Concepción Domínguez, Martine Labbé, Alfredo Marín:
The rank pricing problem with ties. Eur. J. Oper. Res. 294(2): 492-506 (2021) - [j109]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): 48-69 (2021) - [j108]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): 128-152 (2021) - [j107]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): 1027-1040 (2021) - 2020
- [j106]Luce Brotcorne, Bernard Fortz, Martine Labbé:
Special issue on bilevel optimization. EURO J. Comput. Optim. 8(1): 1-2 (2020) - [j105]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): 582-599 (2020) - [j104]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): 1716-1721 (2020)
2010 – 2019
- 2019
- [j103]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: 12-31 (2019) - [j102]Martine Labbé, Marina Leal, Justo Puerto:
New models for the location of controversial facilities: A bilevel programming approach. Comput. Oper. Res. 107: 95-106 (2019) - [j101]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: 164-185 (2019) - [j100]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: 276-304 (2019) - [j99]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): 855-868 (2019) - [j98]Veronica Dal Sasso, Luigi De Giovanni, Martine Labbé:
Strengthened Formulations and Valid Inequalities for Single Delay Management in Public Transportation. Transp. Sci. 53(5): 1271-1286 (2019) - [c11]Victor Bucarey, Martine Labbé:
Discussion of Fairness and Implementability in Stackelberg Security Games. GameSec 2019: 97-117 - [c10]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: 65-76 - [e1]Bernard Fortz, Martine Labbé:
Operations Research Proceedings 2018, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Brussels, Belgium, September 12-14, 2018. Springer 2019, ISBN 978-3-030-18499-5 [contents] - 2018
- [i1]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 abs/1808.02435 (2018) - 2017
- [j97]Felipe Lagos, Fernando Ordóñez, Martine Labbé:
A branch and price algorithm for a Stackelberg Security Game. Comput. Ind. Eng. 111: 216-227 (2017) - [j96]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: 230-242 (2017) - [j95]Manlio Gaudioso, Enrico Gorgone, Martine Labbé, Antonio M. Rodríguez-Chía:
Lagrangian relaxation for SVM feature selection. Comput. Oper. Res. 87: 137-145 (2017) - [j94]Lorenzo Castelli, Martine Labbé, Alessia Violin:
Network pricing problem with unit toll. Networks 69(1): 83-93 (2017) - 2016
- [j93]Martine Labbé, Alessia Violin:
Bilevel programming and price setting problems. Ann. Oper. Res. 240(1): 141-169 (2016) - [c9]Veronica Dal Sasso, Luigi De Giovanni, Martine Labbé:
A Column Generation Approach for Pure Parsimony Haplotyping. SCOR 2016: 5:1-5:11 - 2015
- [j92]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): 766-777 (2015) - [j91]Tue Rauff Lind Christensen, Martine Labbé:
A branch-cut-and-price algorithm for the piecewise linear transportation problem. Eur. J. Oper. Res. 245(3): 645-655 (2015) - 2014
- [j90]Sebastián Maldonado, Juan Pérez, Richard Weber, Martine Labbé:
Feature selection for Support Vector Machines via Mixed Integer Linear Programming. Inf. Sci. 279: 163-175 (2014) - 2013
- [j89]Martine Labbé, Alessia Violin:
Bilevel programming and price setting problems. 4OR 11(1): 1-30 (2013) - [j88]Daniele Catanzaro, Martine Labbé, Raffaele Pesenti:
The balanced minimum evolution problem under uncertain data. Discret. Appl. Math. 161(13-14): 1789-1804 (2013) - [j87]Martine Labbé, M. Grazia Speranza:
Editorial. EURO J. Comput. Optim. 1(1-2): 1-2 (2013) - [j86]Bernard Fortz, Martine Labbé, Alessia Violin:
Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs. Electron. Notes Discret. Math. 41: 117-124 (2013) - [j85]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): 199-221 (2013) - [j84]Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
A branch-and-cut algorithm for the ring spur assignment problem. Networks 61(2): 89-103 (2013) - [j83]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): 1391-1402 (2013) - [c8]Rosa M. V. Figueiredo, Yuri Frota, Martine Labbé:
Solution of the Maximum $$k$$ k -Balanced Subgraph Problem. LION 2013: 266-271 - 2012
- [j82]Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González:
The Balanced Minimum Evolution Problem. INFORMS J. Comput. 24(2): 276-294 (2012) - [c7]Daniele Catanzaro, Martine Labbé, Bjarni V. Halldórsson:
A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem. ISBRA 2012: 24-35 - 2011
- [j81]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): 539-549 (2011) - [j80]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): 1483-1492 (2011) - [j79]Daniele Catanzaro, Martine Labbé, Martha Salazar-Neumann:
Reduction approaches for robust shortest path problems. Comput. Oper. Res. 38(11): 1610-1619 (2011) - [j78]Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard:
Valid inequalities and branch-and-cut for the clique pricing problem. Discret. Optim. 8(3): 393-410 (2011) - [j77]Sergio García, Martine Labbé, Alfredo Marín:
Solving Large p-Median Problems with a Radius Formulation. INFORMS J. Comput. 23(4): 546-556 (2011) - [j76]Claudio Arbib, Martine Labbé, Mara Servilio:
Scheduling two chains of unit jobs on one machine: A polyhedral study. Networks 58(2): 103-113 (2011) - [j75]Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González:
Generalized network design polyhedra. Networks 58(2): 125-136 (2011) - [c6]Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
Improved Formulations for the Ring Spur Assignment Problem. INOC 2011: 24-36 - 2010
- [j74]Martine Labbé, F. Aykut Özsoy:
Size-constrained graph partitioning polytopes. Discret. Math. 310(24): 3473-3493 (2010) - [j73]Daniele Catanzaro, Alessandra Godi, Martine Labbé:
A Class Representative Model for Pure Parsimony Haplotyping. INFORMS J. Comput. 22(2): 195-209 (2010) - [j72]Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard:
A polyhedral study of the network pricing problem with connected toll arcs. Networks 55(3): 234-246 (2010)
2000 – 2009
- 2009
- [j71]Pierre Hansen, Martine Labbé, David Schindl:
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. Discret. Optim. 6(2): 135-147 (2009) - [j70]Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop:
Pricing Geometric Transportation Networks. Int. J. Comput. Geom. Appl. 19(6): 507-520 (2009) - [j69]Daniele Catanzaro, Martine Labbé:
The pure parsimony haplotyping problem: overview and computational advances. Int. Trans. Oper. Res. 16(5): 561-584 (2009) - [j68]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): 126-140 (2009) - [j67]Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman:
Generating Facets for the Independence System Polytope. SIAM J. Discret. Math. 23(3): 1484-1506 (2009) - 2008
- [j66]Paola Bertolazzi, Alessandra Godi, Martine Labbé, Leonardo Tininini:
Solving haplotyping inference parsimony problem using a new basic polynomial formulation. Comput. Math. Appl. 55(5): 900-911 (2008) - [j65]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): 762-774 (2008) - [j64]Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard:
Joint Design and Pricing on a Network. Oper. Res. 56(5): 1104-1115 (2008) - [j63]Martine Labbé, Hande Yaman:
Solving the hub location problem in a star-star network. Networks 51(1): 19-33 (2008) - [j62]Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman:
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks 52(4): 287-298 (2008) - [j61]Sophie Dewez, Martine Labbé, Patrice Marcotte, Gilles Savard:
New formulations and valid inequalities for a bilevel pricing problem. Oper. Res. Lett. 36(2): 141-149 (2008) - 2007
- [j60]Pietro Belotti, Martine Labbé, Francesco Maffioli, Malick M. Ndiaye:
A branch-and-cut method for the obnoxious p -median problem. 4OR 5(4): 299-314 (2007) - [j59]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): 116-133 (2007) - [j58]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): 141-150 (2007) - [c5]Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard:
On a network pricing problem with consecutive toll arcs. CTW 2007: 67-68 - 2006
- [j57]Martine Labbé, José Pinto Paixão, Maria Grazia Speranza:
Preface. Ann. Oper. Res. 144(1): 1 (2006) - [j56]Martine Labbé, Hande Yaman:
Polyhedral Analysis for Concentrator Location Problems. Comput. Optim. Appl. 34(3): 377-407 (2006) - [c4]Martine Labbé:
Bilevel Programming and Price Setting Problems. OR 2006: 109 - [p1]Bernard Fortz, Martine Labbé:
Polyhedral Approaches to the Design of Survivable Networks. Handbook of Optimization in Telecommunications 2006: 367-389 - 2005
- [j55]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): 457-470 (2005) - [j54]Martine Labbé, Hande Yaman, Éric Gourdin:
A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102(2): 371-405 (2005) - [c3]Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop:
Pricing of Geometric Transportation Networks. CCCG 2005: 92-96 - [c2]Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot:
A Tight Analysis of the Maximal Matching Heuristic. COCOON 2005: 701-709 - 2004
- [j53]Bernard Fortz, Martine Labbé:
Two-Connected Networks with Rings of Bounded Cardinality. Comput. Optim. Appl. 27(2): 123-148 (2004) - [j52]Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn:
Adapting polyhedral properties from facility to hub location problems. Discret. Appl. Math. 145(1): 104-116 (2004) - [j51]Sourour Elloumi, Martine Labbé, Yves Pochet:
A New Formulation and Resolution Method for the p-Center Problem. INFORMS J. Comput. 16(1): 83-94 (2004) - [j50]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): 513-520 (2004) - [j49]Corinne Feremans, Martine Labbé, Gilbert Laporte:
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. Networks 43(2): 71-86 (2004) - [j48]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): 177-189 (2004) - [j47]Martine Labbé, Hande Yaman:
Projecting the flow variables for hub location problems. Networks 44(2): 84-93 (2004) - 2003
- [j46]Corinne Feremans, Martine Labbé, Gilbert Laporte:
Generalized network design problems. Eur. J. Oper. Res. 148(1): 1-13 (2003) - [j45]Martine Labbé, Gilbert Laporte, Silvano Martello:
Upper bounds and algorithms for the maximum cardinality bin packing problem. Eur. J. Oper. Res. 149(3): 490-498 (2003) - [j44]Nenad Mladenovic, Martine Labbé, Pierre Hansen:
Solving the p-Center problem with Tabu Search and Variable Neighborhood Search. Networks 42(1): 48-64 (2003) - 2002
- [j43]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): 33-53 (2002) - [j42]Bernard Fortz, Martine Labbé:
Polyhedral results for two-connected networks with bounded rings. Math. Program. 93(1): 27-54 (2002) - [j41]Corinne Feremans, Martine Labbé, Gilbert Laporte:
A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39(1): 29-34 (2002) - [c1]Jean Cardinal, Sourour Elloumi, Martine Labbé:
Local optimization of index assignments for multiple description coding. EUSIPCO 2002: 1-4 - 2001
- [j40]Martine Labbé, Gilbert Laporte, Silvano Martello:
Preface. Discret. Appl. Math. 112(1-3): 1 (2001) - [j39]Corinne Feremans, Martine Labbé, Gilbert Laporte:
On generalized minimum spanning trees. Eur. J. Oper. Res. 134(2): 457-458 (2001) - [j38]Eugène Manzi, Martine Labbé, Guy Latouche, Francesco Maffioli:
Fishman's sampling plan for computing network reliability. IEEE Trans. Reliab. 50(1): 41-46 (2001) - [j37]Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard:
A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network. Transp. Sci. 35(4): 345-358 (2001) - 2000
- [j36]Rainer E. Burkard, Martine Labbé, M. Teresa Ramos, Joaquin Sicilia:
Recent advances in theory and practice of combinatorial optimization (ECCO X). Eur. J. Oper. Res. 123(2): 227-228 (2000) - [j35]Éric Gourdin, Martine Labbé, Gilbert Laporte:
The Uncapacitated Facility Location Problem with Client Matching. Oper. Res. 48(5): 671-685 (2000) - [j34]Bernard Fortz, Martine Labbé, Francesco Maffioli:
Solving the Two-Connected Network with Bounded Meshes Problem. Oper. Res. 48(6): 866-877 (2000) - [j33]Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard:
A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem. Transp. Sci. 34(3): 289-302 (2000)
1990 – 1999
- 1999
- [j32]János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
Two Simple Algorithms for bin Covering. Acta Cybern. 14(1): 13-25 (1999) - [j31]Corinne Feremans, Martine Labbé, Gilbert Laporte:
The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut. Electron. Notes Discret. Math. 3: 45-50 (1999) - [j30]Anne de Jongh, Michel Gendreau, Martine Labbé:
Finding Disjoint Routes in Telecommunications Networks with Two Technologies. Oper. Res. 47(1): 81-92 (1999) - [j29]Horst W. Hamacher, Martine Labbé, Stefan Nickel:
Multicriteria network location problems with sum objectives. Networks 33(2): 79-92 (1999) - [j28]S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel:
Locations on time-varying networks. Networks 34(4): 250-257 (1999) - [j27]Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
Exact solution of the SONET Ring Loading Problem. Oper. Res. Lett. 25(3): 119-129 (1999) - 1998
- [j26]Martine Labbé, Gilbert Laporte, Patrick Soriano:
Covering a graph with cycles. Comput. Oper. Res. 25(6): 499-504 (1998) - [j25]Martine Labbé:
TSS Dissertation Abstracts - Abstracts for the 1997 Transportation Science Section Dissertation Prize Competition. Transp. Sci. 32(1): 74-83 (1998) - 1996
- [j24]Karen I. Aardal, Martine Labbé, Janny Leung, Maurice Queyranne:
On the Two-Level Uncapacitated Facility Location Problem. INFORMS J. Comput. 8(3): 289-301 (1996) - [j23]Mauro Dell'Amico, Martine Labbé, Francesco Maffioli:
Complexity of spanning tree problems with leaf-dependent objectives. Networks 27(3): 175-181 (1996) - [j22]Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi:
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]. Oper. Res. Lett. 18(4): 205 (1996) - 1995
- [j21]Martine Labbé, Gilbert Laporte, Silvano Martello:
An exact algorithm for the dual bin packing problem. Oper. Res. Lett. 17(1): 9-18 (1995) - [j20]Michel Gendreau, Martine Labbé, Gilbert Laporte:
Efficient heuristics for the design of ring networks. Telecommun. Syst. 4(1): 177-188 (1995) - 1994
- [j19]Hans Frenk, Martine Labbé, Mario van Vliet, Shuzhong Zhang:
Improved Algorithms for Machine Allocation in Manufacturing Systems. Oper. Res. 42(3): 523-530 (1994) - [j18]Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi:
Approximation algorithms for the capacitated plant allocation problem. Oper. Res. Lett. 15(3): 115-126 (1994) - 1993
- [j17]János Csirik, J. B. G. Frenk, Martine Labbé:
Two-Dimensional Rectangle Packing: On-Line Methods and Results. Discret. Appl. Math. 45(3): 197-204 (1993) - [j16]S. Louis Hakimi, Edward F. Schmeichel, Martine Labbé:
On locating path- or tree-shaped facilities on networks. Networks 23(6): 543-555 (1993) - [j15]J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
A note on a stochastic location problem. Oper. Res. Lett. 13(4): 213-214 (1993) - 1992
- [j14]S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel:
The Voronoi Partition of a Network and Its Implications in Location Theory. INFORMS J. Comput. 4(4): 412-417 (1992) - 1991
- [j13]János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
Heuristic for the 0-1 Min-Knapsack Problem. Acta Cybern. 10(1-2): 15-20 (1991) - [j12]Pierre Hansen, Martine Labbé, Brigitte Nicolas:
The continuous center set of a network. Discret. Appl. Math. 30(2-3): 181-195 (1991) - [j11]Martine Labbé, Gilbert Laporte, Hélène Mercure:
Capacitated Vehicle Routing on Trees. Oper. Res. 39(4): 616-622 (1991) - [j10]Martine Labbé, S. Louis Hakimi:
Market and Locational Equilibrium for Two Competitors. Oper. Res. 39(5): 749-756 (1991) - [j9]Martine Labbé, Jacques-François Thisse, Richard E. Wendell:
Sensitivity Analysis in Minisum Facility Location Problems. Oper. Res. 39(6): 961-969 (1991) - 1990
- [j8]János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
On the multidimensional vector bin packing. Acta Cybern. 9(4): 361-369 (1990) - [j7]Martine Labbé:
Location of an obnoxious facility on a network: A voting approach. Networks 20(2): 197-207 (1990) - [j6]Martine Labbé, Sue McNeil, Michael D. Meyer, Avishai Ceder:
Bibliographic Section. Transp. Sci. 24(1): 79-86 (1990) - [j5]André de Palma, Pierre Hansen, Martine Labbé:
Commuters' Paths with Penalties for Early or Late Arrival Time. Transp. Sci. 24(4): 276-286 (1990)
1980 – 1989
- 1989
- [j4]Martine Labbé, Jacques-François Thisse:
A tree-network has the fixed point property. Networks 19(2): 255-259 (1989) - [j3]Pierre Hansen, Martine Labbé:
The continuous p-median of a network. Networks 19(5): 595-606 (1989) - [j2]André de Palma, Victor Ginsburgh, Martine Labbé, Jacques-François Thisse:
Competitive Location with Random Utilities. Transp. Sci. 23(4): 244-252 (1989) - 1988
- [j1]Pierre Hansen, Martine Labbé:
Algorithms for Voting and Competitive Location on a Network. Transp. Sci. 22(4): 278-288 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint