Production year

Export Publications

Export the displayed publications:
Number of documents

19

Michael Poss


CNRS researcher at LIRMM, team MAORE

Short CV

I graduated in Mathematics from the Université Libre de Bruxelles, and in Operational Research from the University of Edinburgh. My thesis was done at the GOM research group from the Université Libre de Bruxelles, under the supervision of Bernard Fortz, Martine Labbé, and François Louveaux. During my PhD, I spent time in Rio de Janeiro, working at the Universidade Federal do Rio de Janeiro and at the CEPEL, working with Claudia Sagastizabal and Luciano Moulin. After my thesis was defended in Feburary 2011, I spent a couple of months at the Universidade de Aveiro, followed by a postdoctoral stay at the CMUC from the Universidade de Coimbra. I was a CNRS researcher at Heudiasyc from October 2012 to January 2015 and joined the LIRMM in February 2015. I defended my HdR in November 2016 on robust combinatorial optimization. I have been awarded the Robert Faure prize in 2018.

Research interests

My research interest lies at the junction of combinatorial optimization and mathematical optimization. I study theoretical properties (complexity, approximation) and numerical properties (exact algorithms) of optimization problems motivated by real applications (telecommunications, electrical power, production, transportation, ...). I am more particularly interested in the interplay between uncertainty and discrete optimization.

PhD Students

  • Adrien Cambier (2017 - ...)
  • Ikram Bouras (2016 - 2019)
  • Marco Silva (2015 - 2018)
  • Marcio Costa Santos (2013 - 2016)

Post-doc

  • Aniket Basu Roy (2018-2019)

Open Journal of Mathematical Optimization (OJMO)

We have created a free open-access journal in mathematical optimization: OJMO. The purpose of the journal is to provide a platform for publishing high-quality mathematical optimization research, free of charges for the authors and for the readers.


2018   

Journal articles10 documents

  • Michał Pióro, Ilya Kalesnikau, Michael Poss. Path Generation for Affine Flow Thinning. Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.355 - 364. ⟨10.1016/j.endm.2018.02.010⟩. ⟨hal-01768634⟩
  • Zacharie Alès, Thi Sang Nguyen, Michael Poss. Minimizing the weighted sum of completion times under processing time uncertainty. Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.15 - 24. ⟨10.1016/j.endm.2018.01.003⟩. ⟨hal-01768638⟩
  • Marco Silva, Michael Poss, Nelson Maculan. $k$ -Adaptive Routing for the Robust Network Loading Problem. Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.95-104. ⟨10.1016/j.endm.2018.01.011⟩. ⟨hal-01768637⟩
  • Sara Mattia, Michael Poss. A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation. Computational Optimization and Applications, Springer Verlag, 2018, 69 (3), pp.753 - 800. ⟨10.1007/s10589-017-9956-z⟩. ⟨hal-01768646⟩
  • Michael Poss. Robust combinatorial optimization with knapsack uncertainty. Discrete Optimization, Elsevier, 2018, 27, pp.88 - 102. ⟨10.1016/j.disopt.2017.09.004⟩. ⟨hal-01444717v3⟩
  • Marin Bougeret, Artur Alves Pessoa, Michael Poss. Robust scheduling with budgeted uncertainty. Discrete Applied Mathematics, Elsevier, 2018, 261 (31), pp.93-107. ⟨10.1016/j.dam.2018.07.001⟩. ⟨lirmm-02020566⟩
  • José Gentile, Artur Alves Pessoa, Michael Poss, Marcos Costa Roboredo. Integer programming formulations for three sequential discrete competitive location problems with foresight. European Journal of Operational Research, Elsevier, 2018, 265 (3), pp.872-881. ⟨10.1016/j.ejor.2017.08.041⟩. ⟨lirmm-01653290⟩
  • Wim van Ackooij, Jérôme de Boeck, Boris Detienne, Stefania Pan, Michael Poss. Optimizing power generation in the presence of micro-grids. European Journal of Operational Research, Elsevier, 2018, 271 (2), pp.450-461. ⟨10.1016/j.ejor.2018.05.042⟩. ⟨hal-01836057⟩
  • Marco Silva, Michael Poss, Nelson Maculan. Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing. Networks, Wiley, 2018, Special Issue: Special Issue “New Advances and Applications in Deterministic and Stochastic Network Optimization”, 72 (1), pp.151-170. ⟨10.1002/net.21807⟩. ⟨hal-01537872⟩
  • Marcio Santos, Michael Poss, Dritan Nace. A perfect information lower bound for robust lot-sizing problems. Annals of Operations Research, Springer Verlag, 2018, 271 (2), pp.887-913. ⟨10.1007/s10479-018-2908-x⟩. ⟨hal-01409515v3⟩

Conference papers8 documents

  • Artur Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck. Solving the robust CVRP under demand uncertainty. ODYSSEUS, Jun 2018, Calgliari, Italy. ⟨hal-01703181⟩
  • Marinela Shehaj, Dritan Nace, Michał Pióro, Michael Poss, Fabio D’andreagiovanni, et al.. Robust network dimensioning - the case of FSO networks. Programme Gaspard Monge pour l'optimisation, la recherche opérationnelle et leurs interactions avec les sciences des données (PGMO DAYS 2018), Nov 2018, Paris, France. ⟨hal-01975103⟩
  • Eric Bourreau, Michael Poss, Cyril Bouvier. Robust Optimization On GPU: a use case, shortest paths. EURO: European Conference on Operational Research, Jul 2018, Valencia, Spain. ⟨lirmm-01875585⟩
  • Eric Bourreau, Michael Poss, Cyril Bouvier. Optimisation Robuste sur GPU. Cas d’application : les plus courts chemins. ROADEF: Recherche Opérationnelle et Aide à la Décision, Feb 2018, Lorient, France. ⟨lirmm-01875581⟩
  • Michal Pioro, Ilya Kalesnikau, Michael Poss, Dritan Nace, Artur Tomaszewski. Practical aspects of Flow Thinning optimization. 10th International Workshop on Resilient Networks Design and Modeling (RNDM), Aug 2018, Longyearbyen, Norway. pp.1-8. ⟨hal-01974182⟩
  • Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss. Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator. EURO: European Conference on Operational Research, Jul 2018, Valencia, Spain. ⟨hal-02189508⟩
  • Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhoo. Exact Algorithms for Fixed Charge Network Design Problem with User-Optimal Flows. IWOBIP: International Workshop on Bilevel Programming, Jun 2018, Lille, France. ⟨hal-02188525⟩
  • Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou. Exact Algorithms for Fixed Charge Network Design Problem with User Optimal Flow. Roadef 2018, Feb 2018, Lorient, France. ⟨hal-02192562⟩

Reports1 document

  • Artur Alves Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck. Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty. [Research Report] Cadernos do LOGIS 2018-1, Universidade Federal Fluminense. 2018. ⟨hal-01958184v2⟩