EN FR
Homepage Inria website


Bibliography

Major publications by the team in recent years
  • 1Q. Botton, B. Fortz, L. Gouveia, M. Poss.

    Benders Decomposition for the Hop-Constrained Survivable Network Design Problem, in: INFORMS Journal on Computing, 2013, vol. 25, no 1, pp. 13-26. [ DOI : 10.1287/ijoc.1110.0472 ]

    http://joc.journal.informs.org/content/25/1/13.abstract
  • 2L. Brotcorne, F. Cirinei, P. Marcotte, G. Savard.

    An exact algorithm for the network pricing problem, in: Discrete Optimization, 2011, vol. 8, no 2, pp. 246–258. [ DOI : 10.1016/j.disopt.2010.09.003 ]
  • 3L. Brotcorne, M. Labbé, P. Marcotte, G. Savard.

    Joint design and pricing on a network, in: Operation Research, 2008, vol. 56, pp. 1104-1115. [ DOI : 10.1287/opre.1080.0617 ]
  • 4D. Cattaruzza, N. Absi, D. Feillet.

    The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates, in: Transportation Science, 2016, vol. 50, no 2, pp. 676-693.

    https://doi.org/10.1287/trsc.2015.0608
  • 5M. Fischetti, I. Ljubić, M. Monaci, M. Sinnl.

    A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs, in: Operations Research, December 2017, vol. 65, no 6, pp. 1615 - 1637. [ DOI : 10.1287/opre.2017.1650 ]

    https://hal.inria.fr/hal-01666279
  • 6B. Fortz, M. Labbé, F. Louveaux, M. Poss.

    Stochastic binary problems with simple penalties for capacity constraints violations, in: Mathematical Programming, 2013, vol. 138, pp. 199-221.

    http://dx.doi.org/10.1007/s10107-012-0520-4
  • 7B. Fortz, M. Thorup.

    Internet Traffic Engineering by Optimizing OSPF Weights, in: Proc. 19th IEEE Conf. on Computer Communications (INFOCOM), 2000, pp. 519-528.
  • 8S. García, M. Labbé, A. Marín.

    Solving large p-median problems with a radius formulation, in: INFORMS Journal on Computing, 2011, vol. 23, no 4, pp. 546–556.
  • 9B. Gendron, P.-V. Khuong, F. Semet.

    A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints, in: Transportation Science, 2016, vol. 50, no 4, pp. 1286-1299.

    https://doi.org/10.1287/trsc.2016.0692
  • 10M. Labbé, P. Marcotte, G. Savard.

    A bilevel model of taxation and its application to optimal highway pricing, in: Management science, 1998, vol. 44, no 12-part-1, pp. 1608–1622.
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 11C. Casorrán-Amilburu.

    Formulations and Algorithms for General and Security Stackelberg Games, Université libre de Bruxelles ; Universidad de Chile, October 2017.

    https://hal.inria.fr/tel-01666449

Articles in International Peer-Reviewed Journals

  • 12Q. Botton, B. Fortz, L. Gouveia.

    The 2 edge-disjoint 3-paths polyhedron, in: Annals of Telecommunications - annales des télécommunications, 2017. [ DOI : 10.1007/s12243-017-0615-2 ]

    https://hal.inria.fr/hal-01673313
  • 13S. Brisset, M. Ogier.

    Collaborative and multilevel optimizations of a hybrid railway power substation, in: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, October 2017, pp. 1-13. [ DOI : 10.1002/jnm.2289 ]

    https://hal.inria.fr/hal-01629326
  • 14H. Calik, M. Leitner, M. Luipersbeck.

    A Benders decomposition based framework for solving cable trench problems, in: Computers & Operations Research, May 2017, vol. 81, pp. 128 - 140. [ DOI : 10.1016/j.cor.2016.12.015 ]

    https://hal.inria.fr/hal-01669247
  • 15L. Castelli, M. Labbé, A. Violin.

    Network pricing problem with unit toll, in: Networks, January 2017, vol. 69, no 1, pp. 83–93. [ DOI : 10.1002/net.21701 ]

    https://hal.inria.fr/hal-01419552
  • 16J. De Boeck, B. Fortz.

    Extended formulation for hop constrained distribution network configuration problems, in: European Journal of Operational Research, March 2018, vol. 265, no 2, pp. 488 - 502. [ DOI : 10.1016/j.ejor.2017.08.017 ]

    https://hal.inria.fr/hal-01665624
  • 17M. Fischetti, M. Leitner, I. Ljubić, M. Luipersbeck, M. Monaci, M. Resch, D. Salvagnin, M. Sinnl.

    Thinning out Steiner trees: a node-based model for uniform edge costs, in: Mathematical Programming Computation, June 2017, vol. 9, no 2, pp. 203 - 229. [ DOI : 10.1007/s12532-016-0111-0 ]

    https://hal.inria.fr/hal-01666274
  • 18M. Fischetti, I. Ljubić, M. Monaci, M. Sinnl.

    A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs, in: Operations Research, December 2017, vol. 65, no 6, pp. 1615 - 1637. [ DOI : 10.1287/opre.2017.1650 ]

    https://hal.inria.fr/hal-01666279
  • 19M. Fischetti, I. Ljubić, M. Monaci, M. Sinnl.

    On the use of intersection cuts for bilevel optimization, in: Mathematical Programming, September 2017, pp. 1-27. [ DOI : 10.1007/s10107-017-1189-5 ]

    https://hal.inria.fr/hal-01666294
  • 20M. Fischetti, M. Monaci, M. Sinnl.

    A dynamic reformulation heuristic for Generalized Interdiction Problems, in: European Journal of Operational Research, November 2017, pp. 1-12. [ DOI : 10.1016/j.ejor.2017.11.043 ]

    https://hal.inria.fr/hal-01666298
  • 21B. Fortz, E. Gorgone, D. Papadimitriou.

    A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem, in: Networks, 2017, vol. 69, no 1, pp. 110–123. [ DOI : 10.1002/net.21721 ]

    https://hal.archives-ouvertes.fr/hal-01428061
  • 22B. Fortz, L. Gouveia, M. Joyce-Moniz.

    Models for the piecewise linear unsplittable multicommodity flow problems, in: European Journal of Operational Research, August 2017, vol. 261, no 1, pp. 30 - 42. [ DOI : 10.1016/j.ejor.2017.01.051 ]

    https://hal.inria.fr/hal-01665610
  • 23B. Fortz, L. Gouveia, M. Joyce-Moniz.

    Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol, in: Discrete Applied Mathematics, January 2018, vol. 234, pp. 114 - 130. [ DOI : 10.1016/j.dam.2016.07.015 ]

    https://hal.inria.fr/hal-01665614
  • 24B. Fortz, O. Oliveira, C. Requejo.

    Compact Mixed Integer Linear Programming models to the Minimum Weighted Tree Reconstruction Problem, in: European Journal of Operational Research, 2017, vol. 256, no 1, pp. 242 - 251. [ DOI : 10.1016/j.ejor.2016.06.014 ]

    https://hal.inria.fr/hal-01410554
  • 25F. Furini, I. Ljubić, M. Sinnl.

    An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem, in: European Journal of Operational Research, October 2017, vol. 262, no 2, pp. 438 - 448. [ DOI : 10.1016/j.ejor.2017.03.061 ]

    https://hal.inria.fr/hal-01666303
  • 26M. Gaudioso, E. Gorgone, M. Labbé, A. M. Rodríguez-Chía.

    Lagrangian relaxation for SVM feature selection, in: Computers & Operations Research, November 2017, vol. 87, pp. 137 - 145. [ DOI : 10.1016/j.cor.2017.06.001 ]

    https://hal.inria.fr/hal-01666453
  • 27B. Gendron, P.-V. Khuong, F. Semet.

    Comparison of Formulations for the Two-Level Uncapacitated Facility Location Problem with Single Assignment Constraints, in: Computers and Operations Research, October 2017, vol. 86, pp. 86 - 93. [ DOI : 10.1016/j.cor.2017.02.020 ]

    https://hal.inria.fr/hal-01663595
  • 28M. Labbé, D. Ponce Lopez, J. Puerto.

    A comparative study of formulations and solution methods for the discrete ordered p-median problem, in: Computers and Operations Research, February 2017, vol. 78, pp. 230–242. [ DOI : 10.1016/j.cor.2016.06.004 ]

    https://hal.inria.fr/hal-01419555
  • 29F. Lagos, F. Ordóñez, M. Labbé.

    A branch and price algorithm for a Stackelberg Security Game, in: Computers & Industrial Engineering, September 2017, vol. 111, pp. 216 - 227. [ DOI : 10.1016/j.cie.2017.06.034 ]

    https://hal.inria.fr/hal-01666454
  • 30R. Lahyani, M. Khemakhem, F. Semet.

    A unified matheuristic for solving multi-constrained traveling salesman problems with profits, in: EURO Journal on Computational Optimization, September 2017, vol. 5, no 3, pp. 393 - 422. [ DOI : 10.1007/s13675-016-0071-1 ]

    https://hal.inria.fr/hal-01663624
  • 31M. Leitner, I. Ljubić, M. Luipersbeck, M. Sinnl.

    Decomposition methods for the two-stage stochastic Steiner tree problem, in: Computational Optimization and Applications, 2017, pp. 1-40. [ DOI : 10.1007/s10589-017-9966-x ]

    https://hal.inria.fr/hal-01666307
  • 32M. Leitner, I. Ljubić, J.-J. Salazar-González, M. Sinnl.

    An algorithmic framework for the exact solution of tree-star problems, in: European Journal of Operational Research, August 2017, vol. 261, no 1, pp. 54 - 66. [ DOI : 10.1016/j.ejor.2017.02.011 ]

    https://hal.inria.fr/hal-01666282
  • 33E. Álvarez-Miranda, H. Farhan, M. Luipersbeck, M. Sinnl.

    A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death, in: Annals of Operations Research, November 2017, vol. 258, no 1, pp. 5 - 30. [ DOI : 10.1007/s10479-016-2188-2 ]

    https://hal.inria.fr/hal-01666288
  • 34E. Álvarez-Miranda, I. Ljubić, M. Luipersbeck, M. Sinnl.

    Solving minimum-cost shared arborescence problems, in: European Journal of Operational Research, May 2017, vol. 258, no 3, pp. 887 - 901. [ DOI : 10.1016/j.ejor.2016.11.004 ]

    https://hal.inria.fr/hal-01666315
  • 35E. Álvarez-Miranda, M. Sinnl.

    A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems, in: Computers & Operations Research, November 2017, vol. 87, pp. 63 - 82. [ DOI : 10.1016/j.cor.2017.05.015 ]

    https://hal.inria.fr/hal-01666308
  • 36E. Álvarez-Miranda, M. Sinnl.

    Lagrangian and branch-and-cut approaches for upgrading spanning tree problems, in: Computers & Operations Research, July 2017, vol. 83, pp. 13-27. [ DOI : 10.1016/j.cor.2017.01.014 ]

    https://hal.inria.fr/hal-01666285

Invited Conferences

  • 37L. Brotcorne.

    Les Enjeux de la Recherche Opérationnelle, in: ROAD - Séminaire sur l’application de la Recherche Opérationnelle et l’Aide à la Décision, Abidjan, Côte d’Ivoire, Esatic, April 2017.

    https://hal.inria.fr/hal-01669520
  • 38L. Brotcorne, M. I. Restrepo Ruiz, F. Semet, T. Pocreau.

    Integrated tactical and operational plannings of couriers for attended home delivery, in: NOW 2017 - Network Optimization Workshop, Viterbo, Italy, June 2017.

    https://hal.inria.fr/hal-01664211
  • 39B. Gendron, P.-V. Khuong, F. Semet.

    Models, Relaxations and Heuristics for two-level uncapacitated facility location with single-assignment, in: NOW 2017 - Network Optimization Workshop, Viterbo, Italy, June 2017.

    https://hal.inria.fr/hal-01662094
  • 40M. Labbé, C. Casorrán-Amilburu, B. Fortz, F. Ordóñez.

    Stackelberg games and bilevel bilinear optimisation, in: Combinatorial Optimization and Applications, Edinburgh, United Kingdom, February 2017.

    https://hal.archives-ouvertes.fr/hal-01666558
  • 41M. Labbé.

    Bilevel Optimization, in: Aussois 2017 - 21st Combinatorial Optimization Workshop, Aussois, France, January 2017, Invited tutorial.

    https://hal.archives-ouvertes.fr/hal-01666534
  • 42M. Labbé.

    Bilevel programming: Stackelberg games and pricing problems, in: 21st Conference of the International Federation of Operational Research Societies (IFORS), Québec, Canada, July 2017, EURO Plenary Speaker.

    https://hal.inria.fr/hal-01667075
  • 43M. Labbé.

    Stackelberg games and bilevel bilinear optimization problem , in: Optimization 2017, Lisbon, Portugal, September 2017, Invited Plenary Speaker.

    https://hal.inria.fr/hal-01667094

International Conferences with Proceedings

  • 44P. Carroll, D. Flynn, B. Fortz, A. Melhorn.

    Sub-hour Unit Commitment MILP Model with Benchmark Problem Instances, in: ICCSA 2017 - 17th International Conference on Computational Science and Its Applications, Trieste, Italy, Computational Science and Its Applications - ICCSA 2017, July 2017, vol. 10405, pp. 635-651. [ DOI : 10.1007/978-3-319-62395-5_44 ]

    https://hal.inria.fr/hal-01665611
  • 45D. C. Cattaruzza, P. Gianessi.

    A Branch&Cut algorithm for the Multi-Trip Vehicle Routing Problem with Time Windows, in: IFORS 2017 - 21st Conference of the International Federation of Operational Research Societies, Quebec City, Canada, July 2017, pp. 1-2.

    https://hal.archives-ouvertes.fr/hal-01629463
  • 46H. Çalik, B. Fortz.

    Location of Stations in a One-Way Electric Car Sharing System, in: IEEE Symposium on Computers and Communications, Heraklion, Greece, 2017.

    https://hal.inria.fr/hal-01665609

Conferences without Proceedings

  • 47N. Absi, D. Cattaruzza, D. Feillet, M. Ogier, F. Semet.

    A heuristic branch-cut-and-price algorithm for the ROADEF/EURO challenge on Inventory Routing, in: ROADEF 2017 - 18ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Metz, France, February 2017, pp. 1-2.

    https://hal.inria.fr/hal-01629298
  • 48D. Aussel, L. Brotcorne, L. Von Niederhäusern.

    A trilevel pricing model for demand side management, in: PGMO Days 2017, Paris, France, November 2017.

    https://hal.inria.fr/hal-01669505
  • 49S. Belieres, N. Jozefowiez, F. Semet.

    Supply chain transportation plans optimization - Time-expanded graph enrichment heuristic, in: ICCL 2017 - 8th International Conference on Computational Logistics, Southampton, United Kingdom, October 2017.

    https://hal.inria.fr/hal-01664325
  • 50L. Brotcorne, F. D'Andreagiovanni, J. De Boeck, B. Fortz.

    Unit Commitment under Market Equilibrium Constraints, in: PGMO Days 2017, Paris Saclay, France, November 2017.

    https://hal.inria.fr/hal-01665653
  • 51L. Brotcorne, S. Lepaul, L. Von Niederhäusern.

    Revenue management in the energy field, in: IFORS 2017 - 21st Conference of the International Federation of Operational Research Societies, Québec, Canada, July 2017.

    https://hal.inria.fr/hal-01669456
  • 52L. Brotcorne, A. F. Miguel, M. Labbé, M. I. Restrepo Ruiz.

    Load Scheduling for Residential Demand Response on Smart Grids, in: INFORMS 2017, Houston, United States, October 2017.

    https://hal.inria.fr/hal-01669491
  • 53L. Brotcorne, L. Von Niederhäusern, S. Lepaul.

    A bilevel approach for demand side management in the energy field, in: EUROPT 2017 - 15th Workshop on Advances in Continuous Optimization, Montreal, Canada, July 2017.

    https://hal.inria.fr/hal-01669482
  • 54D. C. Cattaruzza, M. Bué, M. Ogier, F. Semet.

    A heuristic for the integrated storage assignment, order batching and picker routing problem, in: ODS 2017 - International Conference on Optimization and Decision Science, Sorrento, Italy, September 2017.

    https://hal.archives-ouvertes.fr/hal-01629456
  • 55D. C. Cattaruzza, P. Gianessi.

    A Branch&Cut algorithm for the Multi-Trip Vehicle Routing Problem with Time Windows, in: ROADEF2017 - 18ème Conférence de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Metz, France, February 2017.

    https://hal.archives-ouvertes.fr/hal-01651581
  • 56B. Fortz.

    Connectivity and hop constraints in a social graph, in: Optimization 2017, Lisbonne, Portugal, September 2017.

    https://hal.inria.fr/hal-01665647
  • 57B. Fortz, E. Gorgone, D. Papadimitriou.

    Lagrangian relaxation approach for a multi-period network design and routing problem , in: Congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF), Metz, France, February 2017.

    https://hal.inria.fr/hal-01665637
  • 58B. Fortz, M. Leitner.

    Using variables aggregation and Benders decomposition for solving large-scale extended formulations, in: 21st Conference of the International Federation of Operational Research Societies (IFORS), Québec, Canada, July 2017.

    https://hal.inria.fr/hal-01665644
  • 59B. Fortz, M. Leitner.

    Using variables aggregation and Benders decomposition for solving large-scale extended formulations, in: International Conference on Operations Research (OR2017), Berlin, Germany, September 2017.

    https://hal.inria.fr/hal-01665645
  • 60B. Fortz, M. Leitner.

    Using variables aggregation and Benders decomposition for solving large-scale extended formulations, in: Journées de l'optimisation 2017, Montréal, Canada, May 2017.

    https://hal.inria.fr/hal-01665641
  • 61B. Gendron, P.-V. Khuong, F. Semet.

    Models and Relaxations for Two-Level Uncapacitated Facility Location with Single-Assignment, in: ROADEF 2017 - 18ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Metz, France, February 2017.

    https://hal.inria.fr/hal-01664273
  • 62M. Labbé, C. Casorrán-Amilburu, B. Fortz, F. Ordóñez.

    Theoretical and computational comparisons of formulations for Stackelberg bimatrix games, in: 15th EUROPT Workshop on Advances in Continuous Optimization (EUROPT), Montréal, Canada, July 2017.

    https://hal.inria.fr/hal-01667069
  • 63A. F. Miguel, L. Brotcorne, M. Labbé, M. I. Restrepo Ruiz.

    Load Scheduling for Residential Demand Response on Smart Grids, in: VAME 2017 - Variational Analysis and Applications for Modelling of Energy Exchange, Perpignan, France, May 2017.

    https://hal.inria.fr/hal-01669513
  • 64M. Ogier, M. Bué, D. Cattaruzza, F. Semet.

    A heuristic approach to solve an integrated warehouse order picking problem, in: IFORS 2017- 21st Conference of the International Federation of Operational Research Societies, Quebec, Canada, July 2017.

    https://hal.inria.fr/hal-01629308
  • 65F. Semet, L. Brotcorne, M. I. Restrepo Ruiz, T. Pocreau.

    Operational planning of couriers for attended home delivery, in: IFORS 2017 - 21st Conference of the International Federation of Operational Research Societies, Québec, Canada, July 2017.

    https://hal.inria.fr/hal-01664300
References in notes
  • 66C. Casorrán, B. Fortz, M. Labbé, F. Ordóñez.

    Novel formulations for general and security Stackelberg games, 2016, working paper or preprint.

    https://hal.inria.fr/hal-01429265