???global.info.a_carregar???
Michael Poss graduated in Mathematics from the Université Libre de Bruxelles, and in Operational Research from the University of Edinburgh. After his thesis was defended in February 2011, he spent a couple of months at the Universidade de Aveiro, followed by a postdoctoral stay at the CMUC from the Universidade de Coimbra. He was a CNRS researcher at Heudiasyc (France)from October 2012 to January 2015 and joined the LIRMM (France) in February 2015. He defended his habilitation (HdR) in November 2016 on robust combinatorial optimization. He has published more than 35 journal papers, including several publications in the best OR journals (INFORMS Journal on Computing, Mathematical Programming, Operations Research, SIAM Journal on Optimization). His work has been awarded the Robert Faure prize in 2018.
Read full resume ↓
Identification

Personal identification

Full name
Michael Poss

Citation names

  • Poss, Michael

Author identifiers

Ciência ID
291E-60D6-EDEB
ORCID iD
0000-0002-9145-2525

Addresses

  • 161 rue Ada, 34095, Montpellier, Montpellier, France (Professional)

Websites

Knowledge fields

  • Exact Sciences - Mathematics - Applied Mathematics

Languages

Language Speaking Reading Writing Listening Peer-review
French (Mother tongue)
English Proficiency (C2) Proficiency (C2) Proficiency (C2) Proficiency (C2) Proficiency (C2)
Portuguese Proficiency (C2) Proficiency (C2) Advanced (C1) Proficiency (C2) Upper intermediate (B2)
Education
Degree Classification
2007 - 2011
Concluded
 PhD in Sciences (Doktor (PhD))
Université Libre de Bruxelles, Belgium
"Models and Algorithms for Network Design Problems" (THESIS/DISSERTATION)
Affiliation

Science

Category
Host institution 		Employer
2015/01/01 - Current Principal Investigator (Research) Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, France
2013/01 - 2014 Principal Investigator (Research) Heuristique et Diagnostic des Systèmes Complexes, France
2012/01 - 2012/12 Auxiliary Researcher (Research) Universidade de Coimbra Centro de Matemática, Portugal
2011/06 - 2011/12 Auxiliary Researcher (Research) Universidade de Aveiro Centro de Investigação e Desenvolvimento em Matemática e Aplicações, Portugal
Projects

Grant

Designation Funders
2017 - 2020 Robust scheduling with budgeted uncertainty
ANR- 16-CE40-0018
Principal investigator
Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, France

Inria Centre de recherche Bordeaux Sud-Ouest, France

Universidade Federal Fluminense, Brazil
Ongoing
Outputs

Publications

Book
  1. Lesaege, C.; Poss, M.. The partial choice recoverable knapsack problem. 2016.
    10.1007/978-3-319-20430-7_24
  2. Agra, A.; Christiansen, M.; Figueiredo, R.; Magnus Hvattum, L.; Poss, M.; Requejo, C.. Layered formulation for the robust vehicle routing problem with time windows. 2012.
    10.1007/978-3-642-32147-4_23
Book chapter
  1. Poss, Michael. "Approximation Results for Makespan Minimization with Budgeted Uncertainty". 2020.
    10.1007/978-3-030-39479-0_5
  2. Poss, Michael. "Approximating Robust Bin Packing with Budgeted Uncertainty". 2019.
    10.1007/978-3-030-24766-9_6
Conference paper
  1. Fouquet, Y.; Nace, D.; Pióro, M.; Poss, M.. "A restoration framework for partial failures in wireless networks". 2015.
    10.1109/RNDM.2015.7325222
  2. Fouquet, Y.; Nace, D.; Pióro, M.; Poss, M.; Zotkiewicz, M.. "Elastic Rerouting - Models and resolution methods". 2014.
    10.1109/RNDM.2014.7014930
  3. Fouquet, Y.; Nace, D.; Pioro, M.; Poss, M.; Zotkiewicz, M.. "Flow adjustment methods for survivable networks". 2014.
    10.1109/NETWKS.2014.6959261
  4. Zema, N.R.; Natalizio, E.; Poss, M.; Ruggeri, G.; Molinaro, A.. "Healing wireless sensor networks from malicious epidemic diffusion". 2014.
    10.1109/DCOSS.2014.15
  5. Figueiredo, R.; Silva, P.H.G.; Poss, M.. "Transmission expansion planning with re-design: A Greedy Randomized Adaptive Search Procedure". 2012.
Journal article
  1. Marco Silva; Michael Poss; Nelson Maculan. "Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty". European Journal of Operational Research 283 1 (2020): 70-82. https://doi.org/10.1016/j.ejor.2019.10.037.
    10.1016/j.ejor.2019.10.037
  2. Poss, Michael. "Maximum probabilistic all-or-nothing paths". European Journal of Operational Research (2020): http://dx.doi.org/10.1016/j.ejor.2019.11.011.
    10.1016/j.ejor.2019.11.011
  3. Ilya Kalesnikau; Michal Pióro; Michael Poss; Dritan Nace; Artur Tomaszewski. "A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity". Networks (2020): https://doi.org/10.1002/net.21929.
    10.1002/net.21929
  4. Poss, Michael. "Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach". Optimization Letters (2020): http://dx.doi.org/10.1007/s11590-019-01505-x.
    10.1007/s11590-019-01505-x
  5. André Chassein; Marc Goerigk; Jannis Kurtz; Michael Poss. "Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty". European Journal of Operational Research 279 2 (2019): 308-319. https://doi.org/10.1016/j.ejor.2019.05.045.
    10.1016/j.ejor.2019.05.045
  6. Jérémy Omer; Michael Poss. "Time-dependent shortest paths with discounted waits". Networks (2019): https://doi.org/10.1002/net.21885.
    10.1002/net.21885
  7. Ikram Bouras; Rosa Figueiredo; Michael Poss; Fen Zhou. "On two new formulations for the fixed charge network design problem with shortest path constraints". Computers & Operations Research 108 (2019): 226-237. https://doi.org/10.1016/j.cor.2019.04.007.
    10.1016/j.cor.2019.04.007
  8. Luigi Di Puglia Pugliese; Francesca Guerriero; Michael Poss. "The Resource Constrained Shortest Path Problem with uncertain data: A robust formulation and optimal solution approach". Computers & Operations Research 107 (2019): 140-155. https://doi.org/10.1016/j.cor.2019.03.010.
    10.1016/j.cor.2019.03.010
  9. Marcio Costa Santos; Agostinho Agra; Michael Poss. "Robust inventory theory with perishable products". Annals of Operations Research (2019): https://doi.org/10.1007/s10479-019-03264-5.
    10.1007/s10479-019-03264-5
  10. Marin Bougeret; Artur Alves Pessoa; Michael Poss. "Robust scheduling with budgeted uncertainty". Discrete Applied Mathematics 261 (2019): 93-107. https://doi.org/10.1016/j.dam.2018.07.001.
    10.1016/j.dam.2018.07.001
  11. Marcio C. Santos; Hannan Luss; Dritan Nace; Michael Poss. "Proportional and maxmin fairness for the sensor location problem with chance constraints". Discrete Applied Mathematics 261 (2019): 316-331. https://doi.org/10.1016/j.dam.2019.03.004.
    10.1016/j.dam.2019.03.004
  12. Poss, Michael. "Distance Transformation for Network Design Problems". SIAM Journal on Optimization (2019): http://dx.doi.org/10.1137/16m1108261.
    10.1137/16m1108261
  13. Marcio Costa Santos; Michael Poss; Dritan Nace. "A perfect information lower bound for robust lot-sizing problems". Annals of Operations Research 271 2 (2018): 887-913. https://doi.org/10.1007/s10479-018-2908-x.
    10.1007/s10479-018-2908-x
  14. 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 271 2 (2018): 450-461. https://doi.org/10.1016/j.ejor.2018.05.042.
    10.1016/j.ejor.2018.05.042
  15. Poss, Michael. "Solving the bifurcated and nonbifurcated robust network loading problem withk-adaptive routing". Networks (2018): http://dx.doi.org/10.1002/net.21807.
    10.1002/net.21807
  16. Sara Mattia; Michael Poss. "A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation". Computational Optimization and Applications (2018): https://doi.org/10.1007/s10589-017-9956-z.
    10.1007/s10589-017-9956-z
  17. Poss, Michael. "Integer programming formulations for three sequential discrete competitive location problems with foresight". European Journal of Operational Research (2018): http://dx.doi.org/10.1016/j.ejor.2017.08.041.
    10.1016/j.ejor.2017.08.041
  18. Poss, Michael. "A Dynamic Programming Approach for a Class of Robust Optimization Problems". SIAM Journal on Optimization (2016): http://dx.doi.org/10.1137/15m1007070.
    10.1137/15m1007070
  19. Fouquet, Y.; Nace, D.; Pióro, M.; Poss, M.. "An optimization framework for traffic restoration in optical wireless networks with partial link failures". Optical Switching and Networking (2016): http://www.scopus.com/inward/record.url?eid=2-s2.0-84979662866&partnerID=MN8TOARS.
    10.1016/j.osn.2016.06.006
  20. Ayoub, J.; Poss, M.. "Decomposition for adjustable robust linear optimization subject to uncertainty polytope". Computational Management Science 13 2 (2016): 219-239. http://www.scopus.com/inward/record.url?eid=2-s2.0-84959087780&partnerID=MN8TOARS.
    10.1007/s10287-016-0249-2
  21. Pióro, M.; Fouquet, Y.; Nace, D.; Poss, M.. "Optimizing flow thinning protection in multicommodity networks with variable link capacity". Operations Research 64 2 (2016): 273-289. http://www.scopus.com/inward/record.url?eid=2-s2.0-84964613552&partnerID=MN8TOARS.
    10.1287/opre.2016.1486
  22. Pessoa, A.A.; Poss, M.. "Robust network design with uncertain outsourcing cost". INFORMS Journal on Computing 27 3 (2015): 507-524. http://www.scopus.com/inward/record.url?eid=2-s2.0-84947220345&partnerID=MN8TOARS.
    10.1287/ijoc.2015.0643
  23. Alves Pessoa, A.; Di Puglia Pugliese, L.; Guerriero, F.; Poss, M.. "Robust constrained shortest path problems under budgeted uncertainty". Networks 66 2 (2015): 98-111. http://www.scopus.com/inward/record.url?eid=2-s2.0-84938992634&partnerID=MN8TOARS.
    10.1002/net.21615
  24. Destercke, S.; Masson, M.-H.; Poss, M.. "Cautious label ranking with label-wise decomposition". European Journal of Operational Research 246 3 (2015): 927-935. http://www.scopus.com/inward/record.url?eid=2-s2.0-84932196758&partnerID=MN8TOARS.
    10.1016/j.ejor.2015.05.005
  25. Fouquet, Y.; Nace, D.; Piõro, M.; Poss, M.; Zotkiewicz, M.. "Generalized elastic flow rerouting scheme". Networks 66 4 (2015): 267-281. http://www.scopus.com/inward/record.url?eid=2-s2.0-84954544194&partnerID=MN8TOARS.
    10.1002/net.21658
  26. Michael Poss. "Robust combinatorial optimization with variable cost uncertainty". European Journal of Operational Research (2014): http://dx.doi.org/10.1016/j.ejor.2014.02.060.
    10.1016/j.ejor.2014.02.060
  27. Michael Poss. "A comparison of routing sets for robust network design". Optim Lett (2013): http://dx.doi.org/10.1007/s11590-013-0679-5.
    10.1007/s11590-013-0679-5
  28. Michael Poss. "Robust combinatorial optimization with variable budgeted uncertainty". 4OR-Q J Oper Res 11 1 (2013): 75â¿¿92-75â¿¿92. http://dx.doi.org/10.1007/s10288-012-0217-9.
    10.1007/s10288-012-0217-9
  29. Michael Poss; Christian Raack. "Affine recourse for the robust network design problem: Between static and dynamic routing". Networks 61 2 (2013): 180â¿¿198-180â¿¿198. http://dx.doi.org/10.1002/net.21482.
    10.1002/net.21482
  30. Agostinho Agra; Marielle Christiansen; Rosa Figueiredo; Lars Magnus Hvattum; Michael Poss; Cristina Requejo. "The robust vehicle routing problem with time windows". Computers & Operations Research 40 3 (2013): 856â¿¿866-856â¿¿866. http://dx.doi.org/10.1016/j.cor.2012.10.002.
    10.1016/j.cor.2012.10.002
  31. Botton, Q.; Fortz, B.; Gouveia, L.; Poss, M.. "Benders decomposition for the hop-constrained survivable network design problem". INFORMS Journal on Computing 25 1 (2013): 13-26. http://www.scopus.com/inward/record.url?eid=2-s2.0-84877975414&partnerID=MN8TOARS.
    10.1287/ijoc.1110.0472
  32. Fortz, B.; Labbé, M.; Louveaux, F.; Poss, M.. "Stochastic binary problems with simple penalties for capacity constraints violations". Mathematical Programming 138 1-2 (2013): 199-221. http://www.scopus.com/inward/record.url?eid=2-s2.0-84875435973&partnerID=MN8TOARS.
    10.1007/s10107-012-0520-4
  33. Michael Poss. "Models and algorithms for network design problems". 4OR-Q J Oper Res 10 2 (2012): 215â¿¿216-215â¿¿216. http://dx.doi.org/10.1007/s10288-011-0174-8.
    10.1007/s10288-011-0174-8
  34. Agostinho Agra; Catarina Avelino; Adelaide Cerveira; Alexandrino Delgado; Michael Poss. "Lot-sizing and scheduling in a glass container manufacture company". IJMMNO 2 3 (2011): 253-253. http://dx.doi.org/10.1504/ijmmno.2011.040791.
    10.1504/ijmmno.2011.040791
  35. Bernard Fortz; Michael Poss. "Easy distributions for combinatorial optimization problems with probabilistic constraints". Operations Research Letters 38 6 (2010): 545â¿¿549-545â¿¿549. http://dx.doi.org/10.1016/j.orl.2010.09.005.
    10.1016/j.orl.2010.09.005
  36. Luciano S. Moulin; Michael Poss; Claudia Sagastizábal. "Transmission expansion planning with re-design". Energy Syst 1 2 (2010): 113â¿¿139-113â¿¿139. http://dx.doi.org/10.1007/s12667-010-0010-9.
    10.1007/s12667-010-0010-9
  37. Fortz, B.; Poss, M.. "An improved Benders decomposition applied to a multi-layer network design problem". Operations Research Letters 37 5 (2009): 359-364. http://www.scopus.com/inward/record.url?eid=2-s2.0-69549109987&partnerID=MN8TOARS.
    10.1016/j.orl.2009.05.007

Other

Dataset
  1. Poss, Michael. Distributionally robust airline fleet assignment problem.
    10.5441/002/INOC.2019.13
Other output
  1. Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing. 2011. Michael Poss; Christian Raack. http://dx.doi.org/10.1007/978-3-642-21527-8_19.
    10.1007/978-3-642-21527-8_19
Distinctions

Award

2019 Best paper of INFORMS telecommunications section
INFORMS, United States
2018 Robert Faure Prize
ROADEF, France