Michael Poss

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 56

Top Topics

Combinatorial Optimization

Top Venues

Eur. J. Oper. Res.

Oper. Res. Lett.

Opt. Switch. Netw.

Publications

Ayse N. Arslan, Michael Poss
Uncertainty reduction in robust optimization. Oper. Res. Lett. 55 (2024)
Igor Malheiros, Artur Alves Pessoa, Michael Poss, Anand Subramanian
Computing the worst-case due dates violations with budget uncertainty. Oper. Res. Lett. 56 (2024)
Marin Bougeret, Artur Alves Pessoa, Michael Poss
Single machine robust scheduling with budgeted uncertainty. Oper. Res. Lett. 51 (2) (2023)
Marin Bougeret, Jérémy Omer, Michael Poss
Optimization Problems in Graphs with Locational Uncertainty. INFORMS J. Comput. 35 (3) (2023)
Marcos de Melo da Silva, Abdoulaye Gamatié, Gilles Sassatelli, Michael Poss, Michel Robert
Optimization of Data and Energy Migrations in Mini Data Centers for Carbon-Neutral Computing. IEEE Trans. Sustain. Comput. 8 (1) (2023)
Camille Grange, Eric Bourreau, Michael Poss, Vincent T'kindt
Quantum Speed-ups for Single-machine Scheduling Problems. GECCO Companion (2023)
Mariam Sangaré, Eric Bourreau, Bernard Fortz, Amaury Pachurka, Michael Poss
Loads scheduling for demand response in energy communities. Comput. Oper. Res. 160 (2023)
Camille Grange, Michael Poss, Eric Bourreau
An introduction to variational quantum algorithms for combinatorial optimization problems. 4OR 21 (3) (2023)
Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. SIAM J. Discret. Math. 36 (4) (2022)
Marin Bougeret, Jérémy Omer, Michael Poss
Approximating optimization problems in graphs with locational uncertainty. CoRR (2022)
Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss
Optimizing subscriber migrations for a telecommunication operator in uncertain context. Eur. J. Oper. Res. 298 (1) (2022)
Noam Goldberg, Michael Poss
Linearized formulations for failure aware barter exchange. Optim. Lett. 16 (4) (2022)
Ayse N. Arslan, Michael Poss, Marco Silva
Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions. INFORMS J. Comput. 34 (4) (2022)
Jérémy Omer, Michael Poss
A polynomial algorithm for minimizing travel time in consistent time-dependent networks with waits. Networks 77 (3) (2021)
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
Approximation Results for Makespan Minimization with Budgeted Uncertainty. Theory Comput. Syst. 65 (6) (2021)
Jérémy Omer, Michael Poss
Identifying relatively irreducible infeasible subsystems of linear inequalities. Ann. Oper. Res. 304 (1) (2021)
Marin Bougeret, Jérémy Omer, Michael Poss
Optimization problems in graphs with locational uncertainty. CoRR (2021)
Artur Alves Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. Oper. Res. 69 (3) (2021)
Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator. Networks 77 (4) (2021)
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 75 (4) (2020)
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. Optim. Lett. 14 (1) (2020)
Marcio Costa Santos, Agostinho Agra, Michael Poss
Robust inventory theory with perishable products. Ann. Oper. Res. 289 (2) (2020)
Marc Goerigk, Jannis Kurtz, Michael Poss
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty. Discret. Appl. Math. 285 (2020)
Marco Silva, Michael Poss, Nelson Maculan
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty. Eur. J. Oper. Res. 283 (1) (2020)
Noam Goldberg, Michael Poss
Maximum probabilistic all-or-nothing paths. Eur. J. Oper. Res. 283 (1) (2020)
Jérémy Omer, Michael Poss
Time-dependent shortest paths with discounted waits. Networks 74 (3) (2019)
Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa
Distance Transformation for Network Design Problems. SIAM J. Optim. 29 (2) (2019)
Marcio Costa Santos, Hannan Luss, Dritan Nace, Michael Poss
Proportional and maxmin fairness for the sensor location problem with chance constraints. Discret. Appl. Math. 261 (2019)
Marco Silva, Michael Poss
Distributionally robust airline fleet assignment problem. INOC (2019)
Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss
Approximating Robust Bin Packing with Budgeted Uncertainty. WADS (2019)
Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou
On two new formulations for the fixed charge network design problem with shortest path constraints. Comput. Oper. Res. 108 (2019)
Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss
The Resource Constrained Shortest Path Problem with uncertain data: A robust formulation and optimal solution approach. Comput. Oper. Res. 107 (2019)
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
Approximation results for makespan minimization with budgeted uncertainty. CoRR (2019)
Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
Approximation Results for Makespan Minimization with Budgeted Uncertainty. WAOA (2019)
André B. Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. Eur. J. Oper. Res. 279 (2) (2019)
Dritan Nace, Michal Pióro, Michael Poss, Fabio D'Andreagiovanni, Ilya Kalesnikau, Marinela Shehaj, Artur Tomaszewski
An optimization model for robust FSO network dimensioning. Opt. Switch. Netw. 32 (2019)
Marin Bougeret, Artur Alves Pessoa, Michael Poss
Robust scheduling with budgeted uncertainty. Discret. Appl. Math. 261 (2019)
Michal Pióro, Ilya Kalesnikau, Michael Poss
An optimization model for quadratic flow thinning - a traffic protection mechanism for FSO networks. Opt. Switch. Netw. 31 (2019)
Zacharie Alès, Thi Sang Nguyen, Michael Poss
Minimizing the weighted sum of completion times under processing time uncertainty. Electron. Notes Discret. Math. 64 (2018)
Wim van Ackooij, Jérôme De Boeck, Boris Detienne, Stefania Pan, Michael Poss
Optimizing power generation in the presence of micro-grids. Eur. J. Oper. Res. 271 (2) (2018)
Marco Silva, Michael Poss, Nelson Maculan
-Adaptive Routing for the Robust Network Loading Problem. Electron. Notes Discret. Math. 64 (2018)
Michal Pióro, Ilya Kalesnikau, Michael Poss, Dritan Nace, Artur Tomaszewski
Practical aspects of Flow Thinning optimization. RNDM (2018)
Sara Mattia, Michael Poss
A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation. Comput. Optim. Appl. 69 (3) (2018)
Marco Silva, Michael Poss, Nelson Maculan
Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing. Networks 72 (1) (2018)
José Gentile, Artur Alves Pessoa, Michael Poss, Marcos Costa Roboredo
Integer programming formulations for three sequential discrete competitive location problems with foresight. Eur. J. Oper. Res. 265 (3) (2018)
Marcio Costa Santos, Michael Poss, Dritan Nace
A perfect information lower bound for robust lot-sizing problems. Ann. Oper. Res. 271 (2) (2018)
Michal Pióro, Ilya Kalesnikau, Michael Poss
Path Generation for Affine Flow Thinning. Electron. Notes Discret. Math. 64 (2018)
Arie M. C. A. Koster, Michael Poss
Special issue on: robust combinatorial optimization. EURO J. Comput. Optim. 6 (3) (2018)
Michael Poss
Robust combinatorial optimization with knapsack uncertainty. Discret. Optim. 27 (2018)
Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss
An optimization framework for traffic restoration in optical wireless networks with partial link failures. Opt. Switch. Netw. 23 (2017)
Michal Pióro, Ilya Kalesnikau, Michael Poss
An optimization model for affine flow thinning - A traffic protection mechanism for FSO networks. RNDM (2017)
Fabio D'Andreagiovanni, Dritan Nace, Michal Pióro, Michael Poss, Marinela Shehaj, Artur Tomaszewski
On robust FSO network dimensioning. RNDM (2017)
Agostinho Agra, Marcio Costa Santos, Dritan Nace, Michael Poss
A Dynamic Programming Approach for a Class of Robust Optimization Problems. SIAM J. Optim. 26 (3) (2016)
Josette Ayoub, Michael Poss
Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Comput. Manag. Sci. 13 (2) (2016)
Michal Pióro, Yoann Fouquet, Dritan Nace, Michael Poss
Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity. Oper. Res. 64 (2) (2016)
Nicola Roberto Zema, Enrico Natalizio, Giuseppe Ruggeri, Michael Poss, Antonella Molinaro
MeDrone: On the use of a medical drone to heal a sensor network infected by a malicious epidemic. Ad Hoc Networks 50 (2016)
Sébastien Destercke, Marie-Hélène Masson, Michael Poss
Cautious label ranking with label-wise decomposition. Eur. J. Oper. Res. 246 (3) (2015)
Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss, Mateusz Zotkiewicz
Generalized elastic flow rerouting scheme. Networks 66 (4) (2015)
Artur Alves Pessoa, Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss
Robust constrained shortest path problems under budgeted uncertainty. Networks 66 (2) (2015)
Artur Alves Pessoa, Michael Poss
Robust Network Design with Uncertain Outsourcing Cost. INFORMS J. Comput. 27 (3) (2015)
Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss
A restoration framework for partial failures in wireless networks. RNDM@WMNC (2015)
Nicola Roberto Zema, Enrico Natalizio, Michael Poss, Giuseppe Ruggeri, Antonella Molinaro
Healing Wireless Sensor Networks from Malicious Epidemic Diffusion. DCOSS (2014)
Michael Poss
Robust combinatorial optimization with variable cost uncertainty. Eur. J. Oper. Res. 237 (3) (2014)
Michael Poss
A comparison of routing sets for robust network design. Optim. Lett. 8 (5) (2014)
Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia, Michael Poss
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem. INFORMS J. Comput. 25 (1) (2013)
Michael Poss
Robust combinatorial optimization with variable budgeted uncertainty. 4OR 11 (1) (2013)
Bernard Fortz, Martine Labbé, François V. Louveaux, Michael Poss
Stochastic binary problems with simple penalties for capacity constraints violations. Math. Program. 138 (1-2) (2013)
Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo
The robust vehicle routing problem with time windows. Comput. Oper. Res. 40 (3) (2013)
Michael Poss, Christian Raack
Affine recourse for the robust network design problem: Between static and dynamic routing. Networks 61 (2) (2013)
Rosa M. V. Figueiredo, Pedro Henrique González Silva, Michael Poss
Transmission Expansion Planning with Re-design - A Greedy Randomized Adaptive Search Procedure. ICORES (2012)
Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. ISCO (2012)
Michael Poss
Models and algorithms for network design problems. 4OR 10 (2) (2012)
Agostinho Agra, Catarina P. Avelino, Adelaide Cerveira, Alexandrino Delgado, Michael Poss
Lot-sizing and scheduling in a glass container manufacture company. Int. J. Math. Model. Numer. Optimisation 2 (3) (2011)
Michael Poss, Christian Raack
Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing. INOC (2011)
Bernard Fortz, Michael Poss
Easy distributions for combinatorial optimization problems with probabilistic constraints. Oper. Res. Lett. 38 (6) (2010)
Bernard Fortz, Michael Poss
An improved Benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37 (5) (2009)