Skip to Main content

Keywords

Co-authors

Export Publications

Export the displayed publications:
Number of documents

90

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 am a senior researcher (directeur de recherche) since 2020.

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

  • Mariam Sangare (2021 - ...)
  • Guillaume Michel (2020 - ...)
  • Adrien Cambier (2017 - 2020)
  • Ikram Bouras (2016 - 2019)
  • Marco Silva (2015 - 2018)
  • Marcio Costa Santos (2013 - 2016)

Post-doc

  • Aniket Basu Roy (2018-2019)

Selected publications

Full-texts available in the complete list of publications below

  • A. Pessoa, M. Poss, R. Sadykov, and F. Vanderbeck: Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty. Operations research, In press.
  • A. R. Mahjoub, M. Poss, L. Simonetti, E. Uchoa: Distance transformation for network design problems. SIAM J. Optim. 29(2): 1687-1713 (2019)
  • M. Poss: Robust combinatorial optimization with knapsack uncertainty. Discrete Optimization 27: 88-102 (2018).
  • M. Pioro, D. Nace, M. Poss and Y. Fouquet: Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity. Operations Research 64(2): 273-289 (2016).  INFORMS Technical Section on Telecommunications and Network Analytics Best Paper Award 2019
  • A. Agra, D. Nace, M. C. Santos, and M. Poss: A dynamic programming approach for a class of robust optimization problems. SIAM J. Optim. 26-3 (2016), pp. 1799-1823
  • M. Poss: Robust combinatorial optimization with variable budgeted uncertainty. 4OR 11(1): 75-92 (2013)

Open Journal of Mathematical Optimization (OJMO)

If you have ever dreamed of a fair open access journal managed by mathematical optimizers for mathematical optimizers, publishing high-quality works in open access free of charge, you muck check out OJMO's website!


Journal articles49 documents

  • Jérémy Omer, Michael Poss. Identifying relatively irreducible infeasible subsystems of linear inequalities. Annals of Operations Research, Springer Verlag, 2021, 304, pp.361-379. ⟨10.1007/s10479-021-04126-9⟩. ⟨hal-03251527⟩
  • Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss. Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator. Networks, Wiley, In press, ⟨10.1002/net.21970⟩. ⟨hal-02019853v4⟩
  • Marc Goerigk, Jannis Kurtz, Michael Poss. Min-Max-Min Robustness for Combinatorial Problems with Discrete Budgeted Uncertainty. Discrete Applied Mathematics, Elsevier, 2020, 285, pp.707-725. ⟨10.1016/j.dam.2020.07.011⟩. ⟨hal-02335367v3⟩
  • Marco Silva, Michael Poss, Nelson Maculan. Solution Algorithms for Minimizing the Total Tardiness with Budgeted Processing Time Uncertainty. European Journal of Operational Research, Elsevier, 2020, 283 (1), pp.70-82. ⟨10.1016/j.ejor.2019.10.037⟩. ⟨hal-02478655⟩
  • Artur Alves Pessoa, Michael Poss, François Vanderbeck, Ruslan Sadykov, Francois Vanderbeck. Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty. Operations Research, INFORMS, In press, ⟨10.1287/opre.2020.2035⟩. ⟨hal-01958184v4⟩
  • Jérémy Omer, Michael Poss. A polynomial algorithm for minimizing travel time in time-dependent networks with waits. Networks, Wiley, 2020, ⟨10.1002/net.21994⟩. ⟨hal-02022618v3⟩
  • Marcio Costa Santos, Agostinho Agra, Michael Poss. Robust inventory theory with perishable products. Annals of Operations Research, Springer Verlag, 2020, 289 (2), pp.473-494. ⟨10.1007/s10479-019-03264-5⟩. ⟨hal-03113661⟩
  • Ilya Kalesnikau, Michał 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, Wiley, 2020, 75 (4), pp.420-437. ⟨10.1002/net.21929⟩. ⟨hal-02478912⟩
  • Jérémy Omer, Michael Poss. A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits. Networks, Wiley, In press, ⟨10.1002/net.21994⟩. ⟨hal-02964506⟩
  • Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou. Minimizing Energy and Link Utilization in ISP Backbone Networks with multi-path Routing: A Bi-level Approach. Optimization Letters, Springer Verlag, 2019. ⟨hal-02325913⟩
  • Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou. On Two New Formulations for the Fixed Charge Network Design Problem with Shortest Path Constraints. Computers and Operations Research, Elsevier, 2019, 108, pp.226-237. ⟨10.1016/j.cor.2019.04.007⟩. ⟨hal-02013557v2⟩
  • Michał Pióro, Ilya Kalesnikau, Michael Poss. An optimization model for quadratic flow thinning – a traffic protection mechanism for FSO networks. Optical Switching and Networking, Elsevier, 2019, 31, pp.168-182. ⟨10.1016/j.osn.2018.10.002⟩. ⟨hal-01927518⟩
  • Noam Goldberg, Michael Poss. Maximum Probabilistic All-or-Nothing Paths. European Journal of Operational Research, Elsevier, 2019, ⟨10.1016/j.ejor.2019.11.011⟩. ⟨hal-02416268⟩
  • Marcio Santos, Hannan Luss, Dritan Nace, Michael Poss. Proportional and maxmin fairness for the sensor location problem with chance constraints. Discrete Applied Mathematics, Elsevier, 2019, 261 (31), pp.316-331. ⟨10.1016/j.dam.2019.03.004⟩. ⟨hal-02088446⟩
  • Dritan Nace, Michał Pióro, Michael Poss, Fabio D’andreagiovanni, Ilya Kalesnikau, et al.. An optimization model for robust FSO network dimensioning. Optical Switching and Networking, Elsevier, 2019, 32, pp.25-40. ⟨10.1016/j.osn.2018.11.004⟩. ⟨hal-01933963⟩
  • 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, Elsevier, 2019, ⟨10.1016/j.ejor.2019.05.045⟩. ⟨hal-02171552⟩
  • Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa. Distance Transformation for Network Design Problems. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2019, 29 (2), pp.1687-1713. ⟨10.1137/16M1108261⟩. ⟨hal-01632972v3⟩
  • 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 and Operations Research, Elsevier, 2019, 107, pp.140-155. ⟨10.1016/j.cor.2019.03.010⟩. ⟨hal-02086908⟩
  • Jérémy Omer, Michael Poss. Time-dependent shortest path with discounted waits. Networks, Wiley, 2019, 74 (3), pp.287-301. ⟨10.1002/net.21885⟩. ⟨hal-01836007v3⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • Agostinho Agra, Michael Poss, Micael Santos. Optimizing Make-To-Stock policies through a robust lot-sizing model. International Journal of Production Economics, Elsevier, 2018, 200, pp.302-310. ⟨10.1016/j.ijpe.2018.04.002⟩. ⟨hal-02399850⟩
  • 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⟩
  • 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⟩
  • Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss. An optimization framework for traffic restoration in optical wireless networks with partial link failures. Optical Switching and Networking, Elsevier, 2017, Design and modeling of Resilient optical networks RNDM 2015, 23 (2), pp.108-117. ⟨10.1016/j.osn.2016.06.006⟩. ⟨hal-01326761⟩
  • Agostinho Agra, Marcio Costa Santos, Dritan Nace, Michael Poss. A dynamic programming approach for a class of robust optimization problems. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2016, 26 (3), pp.1799-1823. ⟨10.1137/15M1007070⟩. ⟨hal-01348688⟩
  • Michal Pioro, Yoann Fouquet, Dritan Nace, Michael Poss. Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity. Operations Research, INFORMS, 2016, 64 (2), pp.273-289. ⟨10.1287/opre.2016.1486⟩. ⟨hal-01298600⟩
  • Nicola Roberto Zema, Enrico Natalizio, Michael Poss, Giuseppe Ruggeri, Antonella Molinaro. MeDrone: On the use of a medical drone to heal a sensor network infected by a malicious epidemic. Ad Hoc Networks, Elsevier, 2016, 50, pp.115-127. ⟨10.1016/j.adhoc.2016.06.008⟩. ⟨hal-01396858⟩
  • Josette Ayoub, Michael Poss. Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Computational Management Science, Springer Verlag, 2016, 13 (2), pp.219-239. ⟨10.1007/s10287-016-0249-2⟩. ⟨hal-01301374⟩
  • Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss, Mateusz Zotkiewicz. Generalized Elastic Flow Rerouting Scheme. Networks, Wiley, 2015, Optimization Issues in Resilient Network Design and Modeling, 66 (4), pp.267-281. ⟨10.1002/net.21658⟩. ⟨hal-01237389⟩
  • Artur Alves Pessoa, Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss. Robust constrained shortest path problems under budgeted uncertainty. Networks, Wiley, 2015, 66 (2), pp.98-111. ⟨10.1002/net.21615⟩. ⟨hal-01229790⟩
  • Artur Alves Pessoa, Michael Poss. Robust network design with uncertain outsourcing cost. INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2015, 27 (3), pp.431-578. ⟨10.1287/ijoc.2015.0643⟩. ⟨hal-01229787⟩
  • Sébastien Destercke, Marie-Hélène Masson, Michael Poss. Cautious label ranking with label-wise decomposition. European Journal of Operational Research, Elsevier, 2015, 246 (3), pp.927-935. ⟨10.1016/j.ejor.2015.05.005⟩. ⟨hal-01166139⟩
  • Michael Poss. Robust combinatorial optimization with variable cost uncertainty. European Journal of Operational Research, Elsevier, 2014, 237 (3), pp.836-845. ⟨hal-01099569⟩
  • Michael Poss. A comparison of routing sets for robust network design. Optimization Letters, Springer Verlag, 2014, 8 (5), pp.1619-1635. ⟨10.1007/s11590-013-0679-5⟩. ⟨hal-01099565⟩
  • Quentin Botton, Bernard Fortz, Luís Gouveia, Michael Poss. Benders Decomposition for the Hop-Constrained Survivable Network Design Problem. INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2013, 25 (1), pp.13-26. ⟨hal-01255255⟩
  • Agostinho Agra, Marielle Christiansen, Rosa Figueiredo, Lars Magnus, Michael Poss, et al.. The robust vehicle routing problem with time windows. Computers and Operations Research, Elsevier, 2013, 40 (3), pp.856 - 866. ⟨10.1016/j.cor.2012.10.002⟩. ⟨hal-00916976⟩
  • Michael Poss, Christian Raack. Affine recourse for the robust network design problem: Between static and dynamic routing. Networks, Wiley, 2013, 61 (2), pp.180--198. ⟨10.1002/net.21482⟩. ⟨hal-00916978⟩
  • Michael Poss. Robust combinatorial optimization with variable budgeted uncertainty. 4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2013, 11 (1), pp.75-92. ⟨10.1007/s10288-012-0217-9⟩. ⟨hal-00916975⟩
  • Bernard Fortz, Martine Labbé, Fran\ccois Louveaux, Michael Poss. Stochastic binary problems with simple penalties for capacity constraints violations. Mathematical Programming, Springer Verlag, 2013, 138 (1-2), pp.199-221. ⟨hal-01255254⟩
  • Luciano Moulin, Michael Poss, Claudia Sagastizábal. Transmission Expansion Planning with Re-design. Energy Systems, Springer, 2010, 1 (2), pp.113-139. ⟨10.1007/s12667-010-0010-9⟩. ⟨hal-02399898⟩
  • Bernard Fortz, Michael Poss. Easy distributions for combinatorial optimization problems with probabilistic constraints. Operations Research Letters, Elsevier, 2010, 38, pp.545-549. ⟨hal-01255270⟩
  • Bernard Fortz, Michael Poss. An improved benders decomposition applied to a multi-layer network design problem. Operations Research Letters, Elsevier, 2009, 37, pp.359-364. ⟨hal-01255545⟩

Conference papers32 documents

  • Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss. Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator. ROADEF 2020, Feb 2020, Paris, France. ⟨hal-02994335⟩
  • Marco Silva, Michael Poss. Distributionally robust airline fleet assignment problem. INOC: International European Network Conference, Jun 2019, Avignon, France. pp.66-71, ⟨10.5441/002/inoc.2019.13⟩. ⟨lirmm-02194250⟩
  • Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss. Optimizing the investments in mobile network technologies and designing of offers. International Network Optimization Conference, Jun 2019, Avignon, France. ⟨hal-02189459⟩
  • Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou. Bi-level formulation for Minimizing Energy and Link Utilization in ISP Backbone Networks with Multipath Routing Protocol. ROADEF: Recherche Opérationnelle et d'Aide à la Décision, LITIS; LMAH, Feb 2019, Le Havre, France. ⟨hal-02188516⟩
  • Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder. Approximation results for makespan minimization with budgeted uncertainty. WAOA 2019, Sep 2019, Munich, Germany. ⟨hal-02277357⟩
  • Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss. Optimisation conjointe des investissements réseaux mobiles et des migrations des abonnés. ROADEF 2019, Feb 2019, Le Havre, France. ⟨hal-02189469⟩
  • Yacine Al Najjar, Noam Goldberg, Shlomo Karhi, Michael Poss. Robust Two-Stage Packing into Designated and Multipurpose Bins. 9th IFAC Conference on Manufacturing Modelling, Management and Control (MIM), Aug 2019, Berlin, Germany. pp.397-402, ⟨10.1016/j.ifacol.2019.11.157⟩. ⟨hal-02430107⟩
  • Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss. Optimizing Network Investments and Designing of Offers for an Operator. PGMO 2019, Dec 2019, Paris, France. ⟨hal-02994347⟩
  • 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: Recherche Opérationnelle et d'Aide à la Décision, Feb 2018, Lorient, France. ⟨hal-02192562⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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 2018), Aug 2018, Longyearbyen, Norway. pp.1-8, ⟨10.1109/RNDM.2018.8489835⟩. ⟨hal-01974182⟩
  • Michał Pióro, Ilya Kalesnikau, Michael Poss. An optimization model for affine flow thinning — A traffic protection mechanism for FSO networks. RNDM: Resilient Networks Design and Modeling, Sep 2017, Alghero, Italy. ⟨10.1109/RNDM.2017.8093015⟩. ⟨lirmm-02020604⟩
  • Fabio D’andreagiovanni, Dritan Nace, Michal Pioro, Michael Poss, Marinela Shehaj, et al.. On robust FSO network dimensioning. 9th International Workshop on Resilient Networks Design and Modeling (RNDM 2017), Sep 2017, Alghero, Italy. pp.1-8, ⟨10.1109/RNDM.2017.8093027⟩. ⟨hal-01681051⟩
  • Michael Poss, Didier Josselin. Exploring Accurate Spatial Downscaling using Optimization. Spatial Accuracy, Jul 2016, Montpellier, France. ⟨hal-01338085⟩
  • Didier Josselin, Amine Ait Ouahmed, Fen Zhou, Michael Poss. Système de réservation pour l'autopartage de voitures électriques dans un seul sens. ROADEF: Recherche Opérationnelle et Aide à la Décision, Université de Technologie de Compiègne, Feb 2016, Compiègne, France. ⟨hal-01424744⟩
  • Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss. Some challenging problems in resilient network design. ROADEF: Recherche Opérationnelle et Aide à la Décision, Feb 2016, Compiène, France. ⟨hal-01310246⟩
  • Dritan Nace, Michael Poss, Hanan Luss, Marcio Costa Santos. Equitable Sensor Location Problems. ROADEF: Recherche Opérationnelle et Aide à la Décision, Feb 2016, Compiène, France. ⟨hal-01310256⟩
  • Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss. A restoration framework for partial failures in wireless networks. RNDM: Reliable Networks Design and Modeling, Oct 2015, Munich, Germany. pp.149-155, ⟨10.1109/RNDM.2015.7325222⟩. ⟨hal-01298056⟩
  • Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss, Mateusz Zotkiewicz. Flow adjustment methods for survivable networks. Networks: Telecommunications Network Strategy and Planning, Sep 2014, Funchal, Madeira Island, Portugal. ⟨hal-01119355⟩
  • Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss, Mateusz Zotkiewicz. Elastic Rerouting – models and resolution methods. RNDM: Reliable Networks Design and Modeling, Nov 2014, Barcelona, Spain. ⟨hal-01119366⟩
  • Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss. Flow Adjustment - a Flexible Routing Strategy for Demand Protection Against Multiple Partial Link Failures. INFOCOMP: International Conference on Advanced Communications and Computation, Jul 2014, Paris, France. pp.83-90. ⟨hal-01062979⟩
  • Sébastien Destercke, Michael Poss, Mohamed Sallak. Reliability analysis with ill-known probabilities and dependencies. ICVRAM: International Conference on Vulnerability and Risk Analysis and Management, Jul 2014, Liverpool, United Kingdom. pp.887-894, ⟨10.1061/9780784413609.090⟩. ⟨hal-01063025⟩
  • Michal Pioro, Yoann Fouquet, Dritan Nace, Michael Poss, Mateusz Zotkiewicz. An optimization model for communication networks resilient to partial multiple link failures. INFORMS Telecommunications Conference, Mar 2014, Lisbonne, Portugal. ⟨hal-01062962⟩
  • Nicola Roberto Zema, Enrico Natalizio, Michael Poss, Giuseppe Ruggeri, Antonella Molinaro. Healing Wireless Sensor Networks from Malicious Epidemic Diffusion. DCOSS: Distributed Computing in Sensor Systems, May 2014, Marina del Rey, California, United States. pp.171-178, ⟨10.1109/DCOSS.2014.15⟩. ⟨hal-01121277⟩
  • Agostinho Agra, Marielle Christiansen, Rosa Figueiredo, Lars Magnus Hvattum, Michael Poss, et al.. Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. 2nd International Symposium on Combinatorial Optimization, Apr 2012, athens, Greece. pp.249-260, ⟨10.1007/978-3-642-32147-4_23⟩. ⟨hal-00777762⟩
  • R. Figueiredo, P. Gonzalez Silva, Michael Poss. Transmission Expansion Planning with Re-design - A Greedy Randomized Adaptive Search Procedure. ICORES, Feb 2012, Portugal. pp.380-385. ⟨hal-00781328⟩
  • Bernard Fortz, Martine Labbé, Michael Poss. A branch-and-cut-and-price framework for convex MINLP applied to a stochastic network design problem. Proceedings of the European Workshop on Mixed Integer Nonlinear Programming, 2010, Unknown, Unknown Region. pp.131-138. ⟨hal-01255269⟩

Directions of work or proceedings2 documents

  • Benoit Darties, Michael Poss. Network Optimization INOC 2019: 9th International Network Optimization Conference Avignon, France, June 12–14, 2019 Proceedings. OpenProceedings, 2019, 978-3-89318-079-0. ⟨10.5441/002/inoc.2019.01⟩. ⟨lirmm-02194269⟩
  • Serigne Gueye, Babacar M. Ndiaye, Didier Josselin, Michael Poss, Roger Marcelin Faye, et al.. Using mobile phone data for Spatial Planning simulation and Optimization Technologies (SPOT). NetMob conference, Data For Development Challenge Senegal, Apr 2015, Boston, United States. T15, pp.251-269, 2015. ⟨hal-02458463⟩

Preprints, Working Papers, ...6 documents

  • Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss. Optimizing subscriber migrations for a telecommunication operator in uncertain context. 2021. ⟨hal-02893167v2⟩
  • Marin Bougeret, Jérémy Omer, Michael Poss. Optimization problems in graphs with locational uncertainty. 2021. ⟨hal-03331166v2⟩
  • Ayşe Arslan, Michael Poss, Marco Silva. Min-sup-min robust combinatorial optimization with few recourse solutions. 2021. ⟨hal-02939356v3⟩
  • Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss. Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. 2020. ⟨hal-02119351v3⟩
  • Noam Goldberg, Michael Poss. Maximum Expected Value Partial Failure Path Problem. 2020. ⟨hal-02964433v2⟩
  • Jérémy Omer, Michael Poss. Identifying infeasible subsets of linear inequalities that are irreducible with respect to a given subset of the inequalities. 2019. ⟨hal-02290959⟩

Habilitation à diriger des recherches1 document

  • Michael Poss. Contributions to robust combinatorial optimization with budgeted uncertainty. Operations Research [cs.RO]. Université de Montpellier, 2016. ⟨tel-01421260⟩