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 | 249 | 2013 |
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 | 149 | 2011 |
An improved Benders decomposition applied to a multi-layer network design problem B Fortz, M Poss Operations research letters 37 (5), 359-364, 2009 | 147 | 2009 |
Affine recourse for the robust network design problem: Between static and dynamic routing M Poss, C Raack Networks 61 (2), 180-198, 2013 | 86 | 2013 |
Decomposition for adjustable robust linear optimization subject to uncertainty polytope J Ayoub, M Poss Computational Management Science 13, 219-239, 2016 | 79 | 2016 |
Transmission expansion planning with re-design LS Moulin, M Poss, C Sagastizábal Energy systems 1, 113-139, 2010 | 66 | 2010 |
Robust scheduling with budgeted uncertainty M Bougeret, AA Pessoa, M Poss Discrete applied mathematics 261, 93-107, 2019 | 54 | 2019 |
Robust combinatorial optimization with variable budgeted uncertainty M Poss 4OR 11, 75-92, 2013 | 53 | 2013 |
Robust combinatorial optimization with variable cost uncertainty M Poss European Journal of Operational Research 237 (3), 836-845, 2014 | 51 | 2014 |
Layered formulation for the robust vehicle routing problem with time windows A Agra, M Christiansen, R Figueiredo, L Magnus Hvattum, M Poss, ... Combinatorial Optimization: Second International Symposium, ISCO 2012 …, 2012 | 49 | 2012 |
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 | 43 | 2016 |
Robust combinatorial optimization with knapsack uncertainty M Poss Discrete Optimization 27, 88-102, 2018 | 38 | 2018 |
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 | 37 | 2015 |
Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty AA Pessoa, M Poss, R Sadykov, F Vanderbeck Operations Research 69 (3), 739-754, 2021 | 34 | 2021 |
Optimizing power generation in the presence of micro-grids W Van Ackooij, J De Boeck, B Detienne, S Pan, M Poss European journal of operational research 271 (2), 450-461, 2018 | 34 | 2018 |
Integer programming formulations for three sequential discrete competitive location problems with foresight J Gentile, AA Pessoa, M Poss, MC Roboredo European Journal of Operational Research 265 (3), 872-881, 2018 | 34 | 2018 |
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 | 29 | 2016 |
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 | 27 | 2016 |
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty A Chassein, M Goerigk, J Kurtz, M Poss European Journal of Operational Research 279 (2), 308-319, 2019 | 25 | 2019 |
The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach LDP Pugliese, F Guerriero, M Poss Computers & Operations Research 107, 140-155, 2019 | 25 | 2019 |