| The quadratic shortest path problem: complexity, approximability, and solution methods B Rostami, A Chassein, M Hopf, D Frey, C Buchheim, F Malucelli, ... European Journal of Operational Research 268 (2), 473-485, 2018 | 41 | 2018 |
| On the Quadratic Shortest Path Problem B Rostami, F Malucelli, D Frey, C Buchheim Lecture Notes in Computer Science 9125, 379-390, 2015 | 39 | 2015 |
| Reliable single allocation hub location problem under hub breakdowns B Rostami, N Kämmerling, C Buchheim, U Clausen Computers & Operations Research 96, 15-29, 2018 | 33 | 2018 |
| Lower Bounds for the Quadratic Minimum Spanning Tree Problem Based on Reduced Cost Computation B Rostami, F Malucelli Computers & Operations Research 64, 177-188, 2015 | 19 | 2015 |
| A revised reformulation-linearization technique for the quadratic assignment problem B Rostami, F Malucelli Discrete Optimization 14, 97-103, 2014 | 18 | 2014 |
| A compact linearisation of euclidean single allocation hub location problems JF Meier, U Clausen, B Rostami, C Buchheim Electronic Notes in Discrete Mathematics 52, 37-44, 2016 | 16 | 2016 |
| Lower bounding procedure for the Asymmetric Quadratic Traveling Salesman Problem B Rostami, F Malucelli, P Belotti, S Gualandi European Journal of Operational Research, 2016 | 15 | 2016 |
| The Uncapacitated Single Allocation p-Hub Median Problem with Stepwise Cost Function B Rostami, C Buchheim Optimization Online, 2015 | 12 | 2015 |
| Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times B Rostami, G Desaulniers, F Errico, A Lodi Operations Research, 2021 | 11* | 2021 |
| Lower bounding procedures for the single allocation hub location problem B Rostami, C Buchheim, JF Meier, U Clausen Electronic notes in discrete mathematics 52, 69-76, 2016 | 11 | 2016 |
| Stochastic single-allocation hub location B Rostami, N Kämmerling, J Naoum-Sawaya, C Buchheim, U Clausen European Journal of Operational Research 289 (3), 1087-1106, 2021 | 9 | 2021 |
| An application of bicriterion shortest paths to collaborative filtering F Malucelli, P Cremonesi, B Rostami 2012 Federated Conference on Computer Science and Information Systems …, 2012 | 6 | 2012 |
| A convex reformulation and an outer approximation for a class of binary quadratic program B Rostami, F Errico, A Lodi Operations Research (forthcoming), 2022 | 5* | 2022 |
| Quadratic TSP: A lower bounding procedure and a column generation approach B Rostami, F Malucelli, P Belotti, S Gualandi 2013 Federated Conference on Computer Science and Information Systems, 377-384, 2013 | 5 | 2013 |
| A graph optimization approach to item-based collaborative filtering B Rostami, P Cremonesi, F Malucelli Recent Advances in Computational Optimization, 15-30, 2013 | 4 | 2013 |
| A decomposition approach for single allocation hub location problems with multiple capacity levels B Rostami, C Strothmann, C Buchheim Lecture Notes in Computer Science, 237-248, 2016 | 2 | 2016 |
| A computational approach to pivot selection in the LP relaxation of set problems F Djannaty, B Rostamy Journal of Applied Mathematics and Decision Sciences 2006, 2006 | 1 | 2006 |
| A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs B Rostami, F Errico, A Lodi Operations Research, 2022 | | 2022 |
| The price of anarchy in truckload transportation spot markets M Haughton, B Rostami, S Espahbod EURO Journal on Transportation and Logistics 11, 100071, 2022 | | 2022 |
| Single Allocation Hub Location with Heterogeneous Economies of Scale B Rostami, M Chitsaz, O Arslan, G Laporte, A Lodi Operations Research, 2021 | | 2021 |
Federico MalucelliProfessor, DEIB, Politecnico di MIlanoVerified email at polimi.it
