Michael Poss

According to our database, Michael Poss authored at least 74 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems.

Camille Grange, Michael Poss, Eric Bourreau, Vincent T'kindt, Olivier Ploton

Eur. J. Oper. Res., 2025

2024

Computing the worst-case due dates violations with budget uncertainty.

Igor Malheiros, Artur Alves Pessoa, Michael Poss, Anand Subramanian

Oper. Res. Lett., 2024

Uncertainty reduction in robust optimization.

Ayse N. Arslan, Michael Poss

Oper. Res. Lett., 2024

2023

Loads scheduling for demand response in energy communities.

Mariam Sangaré, Eric Bourreau, Bernard Fortz, Amaury Pachurka, Michael Poss

Comput. Oper. Res., December, 2023

An introduction to variational quantum algorithms for combinatorial optimization problems.

Camille Grange, Michael Poss, Eric Bourreau

4OR, September, 2023

Single machine robust scheduling with budgeted uncertainty.

Marin Bougeret, Artur Alves Pessoa, Michael Poss

Oper. Res. Lett., March, 2023

Optimization of Data and Energy Migrations in Mini Data Centers for Carbon-Neutral Computing.

Marcos de Melo da Silva, Abdoulaye Gamatié, Gilles Sassatelli, Michael Poss, Michel Robert

IEEE Trans. Sustain. Comput., 2023

Optimization Problems in Graphs with Locational Uncertainty.

Marin Bougeret, Jérémy Omer, Michael Poss

INFORMS J. Comput., 2023

Quantum Speed-ups for Single-machine Scheduling Problems.

Camille Grange, Eric Bourreau, Michael Poss, Vincent T'kindt

Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

2022

Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty.

Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss

SIAM J. Discret. Math., 2022

Linearized formulations for failure aware barter exchange.

Noam Goldberg, Michael Poss

Optim. Lett., 2022

Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions.

Ayse N. Arslan, Michael Poss, Marco Silva

INFORMS J. Comput., 2022

Optimizing subscriber migrations for a telecommunication operator in uncertain context.

Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss

Eur. J. Oper. Res., 2022

Approximating optimization problems in graphs with locational uncertainty.

Marin Bougeret, Jérémy Omer, Michael Poss

CoRR, 2022

2021

A polynomial algorithm for minimizing travel time in consistent time-dependent networks with waits.

Jérémy Omer, Michael Poss

Networks, 2021

Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator.

Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss

Networks, 2021

Approximation Results for Makespan Minimization with Budgeted Uncertainty.

Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder

Theory Comput. Syst., 2021

Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty.

Artur Alves Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck

Oper. Res., 2021

Identifying relatively irreducible infeasible subsystems of linear inequalities.

Jérémy Omer, Michael Poss

Ann. Oper. Res., 2021

2020

Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach.

Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou

Optim. Lett., 2020

A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity.

Ilya Kalesnikau, Michal Pióro, Michael Poss, Dritan Nace, Artur Tomaszewski

Networks, 2020

Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty.

Marco Silva, Michael Poss, Nelson Maculan

Eur. J. Oper. Res., 2020

Maximum probabilistic all-or-nothing paths.

Noam Goldberg, Michael Poss

Eur. J. Oper. Res., 2020

Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty.

Marc Goerigk, Jannis Kurtz, Michael Poss

Discret. Appl. Math., 2020

Robust inventory theory with perishable products.

Marcio Costa Santos, Agostinho Agra, Michael Poss

Ann. Oper. Res., 2020

2019

Distance Transformation for Network Design Problems.

Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa

SIAM J. Optim., 2019

An optimization model for quadratic flow thinning - a traffic protection mechanism for FSO networks.

Michal Pióro, Ilya Kalesnikau, Michael Poss

Opt. Switch. Netw., 2019

An optimization model for robust FSO network dimensioning.

Dritan Nace, Michal Pióro, Michael Poss, Fabio D'Andreagiovanni, Ilya Kalesnikau, Marinela Shehaj, Artur Tomaszewski

Opt. Switch. Netw., 2019

Time-dependent shortest paths with discounted waits.

Jérémy Omer, Michael Poss

Networks, 2019

Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty.

André B. Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss

Eur. J. Oper. Res., 2019

Proportional and maxmin fairness for the sensor location problem with chance constraints.

Marcio Costa Santos, Hannan Luss, Dritan Nace, Michael Poss

Discret. Appl. Math., 2019

Robust scheduling with budgeted uncertainty.

Marin Bougeret, Artur Alves Pessoa, Michael Poss

Discret. Appl. Math., 2019

The Resource Constrained Shortest Path Problem with uncertain data: A robust formulation and optimal solution approach.

Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss

Comput. Oper. Res., 2019

On two new formulations for the fixed charge network design problem with shortest path constraints.

Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou

Comput. Oper. Res., 2019

Approximating Robust Bin Packing with Budgeted Uncertainty.

Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Distributionally robust airline fleet assignment problem.

Marco Silva, Michael Poss

Proceedings of the 9th International Network Optimization Conference, 2019

2018

Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing.

Marco Silva, Michael Poss, Nelson Maculan

Networks, 2018

Integer programming formulations for three sequential discrete competitive location problems with foresight.

José Gentile, Artur Alves Pessoa, Michael Poss, Marcos Costa Roboredo

Eur. J. Oper. Res., 2018

Optimizing power generation in the presence of micro-grids.

Wim van Ackooij, Jérôme De Boeck, Boris Detienne, Stefania Pan, Michael Poss

Eur. J. Oper. Res., 2018

<i>k</i>-Adaptive Routing for the Robust Network Loading Problem.

Marco Silva, Michael Poss, Nelson Maculan

Electron. Notes Discret. Math., 2018

Path Generation for Affine Flow Thinning.

Michal Pióro, Ilya Kalesnikau, Michael Poss

Electron. Notes Discret. Math., 2018

Minimizing the weighted sum of completion times under processing time uncertainty.

Zacharie Alès, Thi Sang Nguyen, Michael Poss

Electron. Notes Discret. Math., 2018

Special issue on: robust combinatorial optimization.

Arie M. C. A. Koster, Michael Poss

EURO J. Comput. Optim., 2018

Robust combinatorial optimization with knapsack uncertainty.

Michael Poss

Discret. Optim., 2018

A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation.

Sara Mattia, Michael Poss

Comput. Optim. Appl., 2018

A perfect information lower bound for robust lot-sizing problems.

Marcio Costa Santos, Michael Poss, Dritan Nace

Ann. Oper. Res., 2018

Practical aspects of Flow Thinning optimization.

Michal Pióro, Ilya Kalesnikau, Michael Poss, Dritan Nace, Artur Tomaszewski

Proceedings of the 10th International Workshop on Resilient Networks Design and Modeling, 2018

2017

An optimization framework for traffic restoration in optical wireless networks with partial link failures.

Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss

Opt. Switch. Netw., 2017

An optimization model for affine flow thinning - A traffic protection mechanism for FSO networks.

Michal Pióro, Ilya Kalesnikau, Michael Poss

Proceedings of the 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM), 2017

On robust FSO network dimensioning.

Fabio D'Andreagiovanni, Dritan Nace, Michal Pióro, Michael Poss, Marinela Shehaj, Artur Tomaszewski

Proceedings of the 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM), 2017

2016

A Dynamic Programming Approach for a Class of Robust Optimization Problems.

Agostinho Agra, Marcio Costa Santos, Dritan Nace, Michael Poss

SIAM J. Optim., 2016

Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity.

Michal Pióro, Yoann Fouquet, Dritan Nace, Michael Poss

Oper. Res., 2016

Decomposition for adjustable robust linear optimization subject to uncertainty polytope.

Josette Ayoub, Michael Poss

Comput. Manag. Sci., 2016

MeDrone: On the use of a medical drone to heal a sensor network infected by a malicious epidemic.

Nicola Roberto Zema, Enrico Natalizio, Giuseppe Ruggeri, Michael Poss, Antonella Molinaro

Ad Hoc Networks, 2016

Contributions to robust combinatorial optimization with budgeted uncertainty.

Michael Poss

, 2016

2015

Robust constrained shortest path problems under budgeted uncertainty.

Artur Alves Pessoa, Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss

Networks, 2015

Generalized elastic flow rerouting scheme.

Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss, Mateusz Zotkiewicz

Networks, 2015

Robust Network Design with Uncertain Outsourcing Cost.

Artur Alves Pessoa, Michael Poss

INFORMS J. Comput., 2015

Cautious label ranking with label-wise decomposition.

Sébastien Destercke, Marie-Hélène Masson, Michael Poss

Eur. J. Oper. Res., 2015

A restoration framework for partial failures in wireless networks.

Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss

Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

2014

A comparison of routing sets for robust network design.

Michael Poss

Optim. Lett., 2014

Robust combinatorial optimization with variable cost uncertainty.

Michael Poss

Eur. J. Oper. Res., 2014

Healing Wireless Sensor Networks from Malicious Epidemic Diffusion.

Nicola Roberto Zema, Enrico Natalizio, Michael Poss, Giuseppe Ruggeri, Antonella Molinaro

Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems, 2014

2013

Affine recourse for the robust network design problem: Between static and dynamic routing.

Michael Poss, Christian Raack

Networks, 2013

Stochastic binary problems with simple penalties for capacity constraints violations.

Bernard Fortz, Martine Labbé, François V. Louveaux, Michael Poss

Math. Program., 2013

Benders Decomposition for the Hop-Constrained Survivable Network Design Problem.

Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia, Michael Poss

INFORMS J. Comput., 2013

The robust vehicle routing problem with time windows.

Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo

Comput. Oper. Res., 2013

Robust combinatorial optimization with variable budgeted uncertainty.

Michael Poss

4OR, 2013

2012

Models and algorithms for network design problems.

Michael Poss

4OR, 2012

Layered Formulation for the Robust Vehicle Routing Problem with Time Windows.

Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Transmission Expansion Planning with Re-design - A Greedy Randomized Adaptive Search Procedure.

Rosa M. V. Figueiredo, Pedro Henrique González, Michael Poss

Proceedings of the ICORES 2012, 2012

2011

Lot-sizing and scheduling in a glass container manufacture company.

Agostinho Agra, Catarina P. Avelino, Adelaide Cerveira, Alexandrino Delgado, Michael Poss

Int. J. Math. Model. Numer. Optimisation, 2011

2010

Easy distributions for combinatorial optimization problems with probabilistic constraints.

Bernard Fortz, Michael Poss

Oper. Res. Lett., 2010

2009

An improved Benders decomposition applied to a multi-layer network design problem.

Bernard Fortz, Michael Poss

Oper. Res. Lett., 2009