default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Poss
Person information
- affiliation: University of Montpellier, LIRMM, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j62]Camille Grange
, Michael Poss, Eric Bourreau, Vincent T'kindt, Olivier Ploton:
Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems. Eur. J. Oper. Res. 320(3): 516-526 (2025)- 2024
- [j61]Ayse N. Arslan, Michael Poss:
Uncertainty reduction in robust optimization. Oper. Res. Lett. 55: 107131 (2024) - [j60]Igor Malheiros, Artur Alves Pessoa, Michael Poss, Anand Subramanian:
Computing the worst-case due dates violations with budget uncertainty. Oper. Res. Lett. 56: 107148 (2024) - 2023
- [j59]Camille Grange, Michael Poss, Eric Bourreau:
An introduction to variational quantum algorithms for combinatorial optimization problems. 4OR 21(3): 363-403 (2023) - [j58]Mariam Sangaré, Eric Bourreau, Bernard Fortz, Amaury Pachurka, Michael Poss:
Loads scheduling for demand response in energy communities. Comput. Oper. Res. 160: 106358 (2023) - [j57]Marin Bougeret, Jérémy Omer, Michael Poss:
Optimization Problems in Graphs with Locational Uncertainty. INFORMS J. Comput. 35(3): 578-592 (2023) - [j56]Marin Bougeret, Artur Alves Pessoa, Michael Poss:
Single machine robust scheduling with budgeted uncertainty. Oper. Res. Lett. 51(2): 137-141 (2023) - [j55]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): 68-81 (2023) - [c12]Camille Grange, Eric Bourreau, Michael Poss, Vincent T'kindt:
Quantum Speed-ups for Single-machine Scheduling Problems. GECCO Companion 2023: 2224-2231 - 2022
- [j54]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): 308-321 (2022) - [j53]Ayse N. Arslan, Michael Poss, Marco Silva:
Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions. INFORMS J. Comput. 34(4): 2212-2228 (2022) - [j52]Noam Goldberg, Michael Poss:
Linearized formulations for failure aware barter exchange. Optim. Lett. 16(4): 1301-1313 (2022) - [j51]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): 2534-2552 (2022) - [i3]Marin Bougeret, Jérémy Omer, Michael Poss:
Approximating optimization problems in graphs with locational uncertainty. CoRR abs/2206.08187 (2022) - 2021
- [j50]Jérémy Omer, Michael Poss:
Identifying relatively irreducible infeasible subsystems of linear inequalities. Ann. Oper. Res. 304(1): 361-379 (2021) - [j49]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): 739-754 (2021) - [j48]Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder:
Approximation Results for Makespan Minimization with Budgeted Uncertainty. Theory Comput. Syst. 65(6): 903-915 (2021) - [j47]Jérémy Omer, Michael Poss:
A polynomial algorithm for minimizing travel time in consistent time-dependent networks with waits. Networks 77(3): 421-434 (2021) - [j46]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): 495-519 (2021) - [i2]Marin Bougeret, Jérémy Omer, Michael Poss:
Optimization problems in graphs with locational uncertainty. CoRR abs/2109.00389 (2021) - 2020
- [j45]Marcio Costa Santos, Agostinho Agra, Michael Poss:
Robust inventory theory with perishable products. Ann. Oper. Res. 289(2): 473-494 (2020) - [j44]Marc Goerigk, Jannis Kurtz, Michael Poss:
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty. Discret. Appl. Math. 285: 707-725 (2020) - [j43]Marco Silva, Michael Poss, Nelson Maculan:
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty. Eur. J. Oper. Res. 283(1): 70-82 (2020) - [j42]Noam Goldberg, Michael Poss:
Maximum probabilistic all-or-nothing paths. Eur. J. Oper. Res. 283(1): 279-289 (2020) - [j41]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): 420-437 (2020) - [j40]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): 209-227 (2020)
2010 – 2019
- 2019
- [j39]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: 140-155 (2019) - [j38]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: 226-237 (2019) - [j37]Marin Bougeret, Artur Alves Pessoa, Michael Poss:
Robust scheduling with budgeted uncertainty. Discret. Appl. Math. 261: 93-107 (2019) - [j36]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: 316-331 (2019) - [j35]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): 308-319 (2019) - [j34]Jérémy Omer, Michael Poss:
Time-dependent shortest paths with discounted waits. Networks 74(3): 287-301 (2019) - [j33]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: 168-182 (2019) - [j32]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: 25-40 (2019) - [j31]Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa:
Distance Transformation for Network Design Problems. SIAM J. Optim. 29(2): 1687-1713 (2019) - [c11]Marco Silva, Michael Poss:
Distributionally robust airline fleet assignment problem. INOC 2019: 66-71 - [c10]Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss:
Approximating Robust Bin Packing with Budgeted Uncertainty. WADS 2019: 71-84 - [c9]Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder:
Approximation Results for Makespan Minimization with Budgeted Uncertainty. WAOA 2019: 60-71 - [e1]Benoît Darties, Michael Poss:
Proceedings of the 9th International Network Optimization Conference, INOC 2019, Avignon, France, June 12-14, 2019. OpenProceedings.org 2019, ISBN 978-3-89318-079-0 [contents] - [i1]Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder:
Approximation results for makespan minimization with budgeted uncertainty. CoRR abs/1905.08592 (2019) - 2018
- [j30]Marcio Costa Santos, Michael Poss, Dritan Nace:
A perfect information lower bound for robust lot-sizing problems. Ann. Oper. Res. 271(2): 887-913 (2018) - [j29]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): 753-800 (2018) - [j28]Michael Poss:
Robust combinatorial optimization with knapsack uncertainty. Discret. Optim. 27: 88-102 (2018) - [j27]Arie M. C. A. Koster, Michael Poss:
Special issue on: robust combinatorial optimization. EURO J. Comput. Optim. 6(3): 207-209 (2018) - [j26]Zacharie Alès, Thi Sang Nguyen, Michael Poss:
Minimizing the weighted sum of completion times under processing time uncertainty. Electron. Notes Discret. Math. 64: 15-24 (2018) - [j25]Marco Silva, Michael Poss, Nelson Maculan:
k-Adaptive Routing for the Robust Network Loading Problem. Electron. Notes Discret. Math. 64: 95-104 (2018) - [j24]Michal Pióro, Ilya Kalesnikau, Michael Poss:
Path Generation for Affine Flow Thinning. Electron. Notes Discret. Math. 64: 355-364 (2018) - [j23]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): 872-881 (2018) - [j22]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): 450-461 (2018) - [j21]Marco Silva, Michael Poss, Nelson Maculan:
Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing. Networks 72(1): 151-170 (2018) - [c8]Michal Pióro, Ilya Kalesnikau, Michael Poss, Dritan Nace, Artur Tomaszewski:
Practical aspects of Flow Thinning optimization. RNDM 2018: 1-8 - 2017
- [j20]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: 108-117 (2017) - [c7]Fabio D'Andreagiovanni, Dritan Nace, Michal Pióro, Michael Poss, Marinela Shehaj, Artur Tomaszewski:
On robust FSO network dimensioning. RNDM 2017: 1-8 - [c6]Michal Pióro, Ilya Kalesnikau, Michael Poss:
An optimization model for affine flow thinning - A traffic protection mechanism for FSO networks. RNDM 2017: 1-7 - 2016
- [b1]Michael Poss:
Contributions to robust combinatorial optimization with budgeted uncertainty. University of Montpellier, France, 2016 - [j19]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: 115-127 (2016) - [j18]Josette Ayoub, Michael Poss:
Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Comput. Manag. Sci. 13(2): 219-239 (2016) - [j17]Michal Pióro, Yoann Fouquet, Dritan Nace, Michael Poss:
Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity. Oper. Res. 64(2): 273-289 (2016) - [j16]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): 1799-1823 (2016) - 2015
- [j15]Sébastien Destercke, Marie-Hélène Masson, Michael Poss:
Cautious label ranking with label-wise decomposition. Eur. J. Oper. Res. 246(3): 927-935 (2015) - [j14]Artur Alves Pessoa, Michael Poss:
Robust Network Design with Uncertain Outsourcing Cost. INFORMS J. Comput. 27(3): 507-524 (2015) - [j13]Artur Alves Pessoa, Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss:
Robust constrained shortest path problems under budgeted uncertainty. Networks 66(2): 98-111 (2015) - [j12]Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss, Mateusz Zotkiewicz:
Generalized elastic flow rerouting scheme. Networks 66(4): 267-281 (2015) - [c5]Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss:
A restoration framework for partial failures in wireless networks. RNDM@WMNC 2015: 149-155 - 2014
- [j11]Michael Poss:
Robust combinatorial optimization with variable cost uncertainty. Eur. J. Oper. Res. 237(3): 836-845 (2014) - [j10]Michael Poss:
A comparison of routing sets for robust network design. Optim. Lett. 8(5): 1619-1635 (2014) - [c4]Nicola Roberto Zema, Enrico Natalizio, Michael Poss, Giuseppe Ruggeri, Antonella Molinaro:
Healing Wireless Sensor Networks from Malicious Epidemic Diffusion. DCOSS 2014: 171-178 - 2013
- [j9]Michael Poss:
Robust combinatorial optimization with variable budgeted uncertainty. 4OR 11(1): 75-92 (2013) - [j8]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): 856-866 (2013) - [j7]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): 13-26 (2013) - [j6]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): 199-221 (2013) - [j5]Michael Poss, Christian Raack:
Affine recourse for the robust network design problem: Between static and dynamic routing. Networks 61(2): 180-198 (2013) - 2012
- [j4]Michael Poss:
Models and algorithms for network design problems. 4OR 10(2): 215-216 (2012) - [c3]Rosa M. V. Figueiredo, Pedro Henrique González, Michael Poss:
Transmission Expansion Planning with Re-design - A Greedy Randomized Adaptive Search Procedure. ICORES 2012: 380-385 - [c2]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: 249-260 - 2011
- [j3]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): 253-272 (2011) - [c1]Michael Poss, Christian Raack:
Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing. INOC 2011: 150-155 - 2010
- [j2]Bernard Fortz, Michael Poss:
Easy distributions for combinatorial optimization problems with probabilistic constraints. Oper. Res. Lett. 38(6): 545-549 (2010)
2000 – 2009
- 2009
- [j1]Bernard Fortz, Michael Poss:
An improved Benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37(5): 359-364 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
