| Solving a fuel delivery problem by heuristic and exact approaches P Avella, M Boccia, A Sforza European Journal of Operational Research 152 (1), 170-179, 2004 | 196 | 2004 |
| A metaheuristic for a two echelon location-routing problem M Boccia, TG Crainic, A Sforza, C Sterle Experimental Algorithms: 9th International Symposium, SEA 2010, Ischia …, 2010 | 163 | 2010 |
| An aggregation heuristic for large scale p-median problem P Avella, M Boccia, S Salerno, I Vasilyev Computers & Operations Research 39 (7), 1625-1632, 2012 | 110 | 2012 |
| A column-and-row generation approach for the flying sidekick travelling salesman problem M Boccia, A Masone, A Sforza, C Sterle Transportation Research Part C: Emerging Technologies 124, 102913, 2021 | 79 | 2021 |
| A computational study of exact knapsack separation for the generalized assignment problem P Avella, M Boccia, I Vasilyev Computational Optimization and Applications 45, 543-555, 2010 | 76 | 2010 |
| Location-routing models for designing a two-echelon freight distribution system M Boccia, TG Crainic, A Sforza, C Sterle Rapport technique, CIRRELT, Université de Montréal 91, 2011 | 74 | 2011 |
| An effective heuristic for large-scale capacitated facility location problems P Avella, M Boccia, A Sforza, I Vasil’ev Journal of Heuristics 15, 597-615, 2009 | 68 | 2009 |
| A cutting plane algorithm for the capacitated facility location problem P Avella, M Boccia Computational Optimization and Applications 43, 39-65, 2009 | 61 | 2009 |
| Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm M Boccia, TG Crainic, A Sforza, C Sterle Computers & Operations Research 89, 94-112, 2018 | 59 | 2018 |
| A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes M Boccia, A Sforza, C Sterle, I Vasilyev Journal of mathematical modelling and algorithms 7, 43-58, 2008 | 53 | 2008 |
| Single-period cutting planes for inventory routing problems P Avella, M Boccia, LA Wolsey Transportation Science 52 (3), 497-508, 2018 | 50 | 2018 |
| The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming M Boccia, C Mannino, I Vasilyev Networks 62 (4), 315-326, 2013 | 44 | 2013 |
| Flow intercepting facility location: Problems, models and heuristics M Boccia, A Sforza, C Sterle Journal of Mathematical Modelling and Algorithms 8, 35-79, 2009 | 43 | 2009 |
| Time-indexed formulations for the runway scheduling problem P Avella, M Boccia, C Mannino, I Vasilyev Transportation Science 51 (4), 1196-1209, 2017 | 42 | 2017 |
| Resource constrained shortest path problems in path planning for fleet management P Avella, M Boccia, A Sforza Journal of Mathematical Modelling and Algorithms 3, 1-17, 2004 | 38 | 2004 |
| Near-optimal solutions of large-scale single-machine scheduling problems P Avella, M Boccia, B D’Auria INFORMS Journal on Computing 17 (2), 183-191, 2005 | 35 | 2005 |
| A penalty function heuristic for the resource constrained shortest path problem P Avella, M Boccia, A Sforza European Journal of Operational Research 142 (2), 221-230, 2002 | 33 | 2002 |
| Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances P Avella, M Boccia, LA Wolsey Networks 65 (2), 129-138, 2015 | 31 | 2015 |
| A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries C Archetti, MG Speranza, M Boccia, A Sforza, C Sterle European Journal of Operational Research 282 (3), 886-895, 2020 | 30 | 2020 |
| Computational experience with general cutting planes for the set covering problem P Avella, M Boccia, I Vasilyev Operations Research Letters 37 (1), 16-20, 2009 | 30 | 2009 |
