Michael Poss
TitleCited byYear
The robust vehicle routing problem with time windows
A Agra, M Christiansen, R Figueiredo, LM Hvattum, M Poss, C Requejo
Computers & operations research 40 (3), 856-866, 2013
1282013
An improved benders decomposition applied to a multi-layer network design problem
B Fortz, M Poss
Operations research letters 37 (5), 359-364, 2009
882009
Benders decomposition for the hop-constrained survivable network design problem
Q Botton, B Fortz, L Gouveia, M Poss
INFORMS Journal on Computing, In press, 2011
852011
Affine recourse for the robust network design problem: Between static and dynamic routing
M Poss, C Raack
Networks 61 (2), 180-198, 2013
422013
Transmission expansion planning with re-design
LS Moulin, M Poss, C Sagastizábal
Energy systems 1 (2), 113-139, 2010
422010
Decomposition for adjustable robust linear optimization subject to uncertainty polytope
J Ayoub, M Poss
Computational Management Science 13 (2), 219-239, 2016
312016
Layered formulation for the robust vehicle routing problem with time windows
A Agra, M Christiansen, R Figueiredo, LM Hvattum, M Poss, C Requejo
International Symposium on Combinatorial Optimization, 249-260, 2012
312012
Robust combinatorial optimization with variable budgeted uncertainty
M Poss
4OR 11 (1), 75-92, 2013
272013
Robust combinatorial optimization with variable cost uncertainty
M Poss
European Journal of Operational Research 237 (3), 836-845, 2014
252014
Affine recourse for the robust network design problem: between static and dynamic routing
M Poss, C Raack
Network Optimization, 150-155, 2011
232011
A dynamic programming approach for a class of robust optimization problems
A Agra, MC Santos, D Nace, M Poss
SIAM Journal on Optimization 26 (3), 1799-1823, 2016
202016
Robust constrained shortest path problems under budgeted uncertainty
A Alves Pessoa, L Di Puglia Pugliese, F Guerriero, M Poss
Networks 66 (2), 98-111, 2015
182015
Stochastic binary problems with simple penalties for capacity constraints violations⋆
B Fortz, M Labbé, F Louveaux, M Poss
Mathematical Programming, 2013
16*2013
A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
S Mattia, M Poss
Computational Optimization and Applications 69 (3), 753-800, 2018
142018
Optimizing flow thinning protection in multicommodity networks with variable link capacity
M Pióro, Y Fouquet, D Nace, M Poss
Operations Research 64 (2), 273-289, 2016
142016
Easy distributions for combinatorial optimization problems with probabilistic constraints
B Fortz, M Poss
Operations research letters 38 (6), 545-549, 2010
132010
A comparison of routing sets for robust network design
M Poss
Optimization Letters 8 (5), 1619-1635, 2014
112014
Robust scheduling with budgeted uncertainty
M Bougeret, AA Pessoa, M Poss
Discrete Applied Mathematics 261, 93-107, 2019
102019
An optimization framework for traffic restoration in optical wireless networks with partial link failures
Y Fouquet, D Nace, M Pióro, M Poss
Optical Switching and Networking 23, 108-117, 2017
92017
MeDrone: On the use of a medical drone to heal a sensor network infected by a malicious epidemic
NR Zema, E Natalizio, G Ruggeri, M Poss, A Molinaro
Ad Hoc Networks 50, 115-127, 2016
92016
The system can't perform the operation now. Try again later.
Articles 1–20