Michael Poss
Orcid: 0000-0002-9145-2525Affiliations:
- University of Montpellier, LIRMM, France
According to our database1,
Michael Poss
authored at least 71 papers
between 2009 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on lirmm.fr
-
on orcid.org
On csauthors.net:
Bibliography
2023
Comput. Oper. Res., December, 2023
An introduction to variational quantum algorithms for combinatorial optimization problems.
4OR, September, 2023
Oper. Res. Lett., March, 2023
Optimization of Data and Energy Migrations in Mini Data Centers for Carbon-Neutral Computing.
IEEE Trans. Sustain. Comput., 2023
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023
2022
SIAM J. Discret. Math., 2022
INFORMS J. Comput., 2022
Optimizing subscriber migrations for a telecommunication operator in uncertain context.
Eur. J. Oper. Res., 2022
CoRR, 2022
2021
A polynomial algorithm for minimizing travel time in consistent time-dependent networks with waits.
Networks, 2021
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator.
Networks, 2021
Theory Comput. Syst., 2021
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty.
Oper. Res., 2021
Ann. Oper. Res., 2021
2020
Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach.
Optim. Lett., 2020
A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity.
Networks, 2020
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty.
Eur. J. Oper. Res., 2020
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty.
Discret. Appl. Math., 2020
2019
An optimization model for quadratic flow thinning - a traffic protection mechanism for FSO networks.
Opt. Switch. Netw., 2019
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty.
Eur. J. Oper. Res., 2019
Proportional and maxmin fairness for the sensor location problem with chance constraints.
Discret. Appl. Math., 2019
The Resource Constrained Shortest Path Problem with uncertain data: A robust formulation and optimal solution approach.
Comput. Oper. Res., 2019
On two new formulations for the fixed charge network design problem with shortest path constraints.
Comput. Oper. Res., 2019
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019
Proceedings of the 9th International Network Optimization Conference, 2019
2018
Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing.
Networks, 2018
Integer programming formulations for three sequential discrete competitive location problems with foresight.
Eur. J. Oper. Res., 2018
Electron. Notes Discret. Math., 2018
Electron. Notes Discret. Math., 2018
A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation.
Comput. Optim. Appl., 2018
Ann. Oper. Res., 2018
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.
Opt. Switch. Netw., 2017
An optimization model for affine flow thinning - A traffic protection mechanism for FSO networks.
Proceedings of the 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM), 2017
Proceedings of the 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM), 2017
2016
SIAM J. Optim., 2016
Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity.
Oper. Res., 2016
Decomposition for adjustable robust linear optimization subject to uncertainty polytope.
Comput. Manag. Sci., 2016
MeDrone: On the use of a medical drone to heal a sensor network infected by a malicious epidemic.
Ad Hoc Networks, 2016
2015
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015
2014
Eur. J. Oper. Res., 2014
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.
Networks, 2013
Stochastic binary problems with simple penalties for capacity constraints violations.
Math. Program., 2013
INFORMS J. Comput., 2013
2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
Transmission Expansion Planning with Re-design - A Greedy Randomized Adaptive Search Procedure.
Proceedings of the ICORES 2012, 2012
2011
Int. J. Math. Model. Numer. Optimisation, 2011
2010
Easy distributions for combinatorial optimization problems with probabilistic constraints.
Oper. Res. Lett., 2010
2009
Oper. Res. Lett., 2009