| Computational study of large-scale p-Median problems P Avella, A Sassano, I Vasil'ev Mathematical Programming 109, 89-114, 2007 | 285 | 2007 |
| 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 | 195 | 2004 |
| 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 | 109 | 2012 |
| On the p-Median polytope P Avella, A Sassano Mathematical Programming 89 (3), 395-411, 2001 | 92 | 2001 |
| A computational study of a cutting plane algorithm for university course timetabling P Avella, I Vasil'Ev Journal of Scheduling 8 (6), 497-514, 2005 | 86 | 2005 |
| Metric inequalities and the network loading problem P Avella, S Mattia, A Sassano Discrete Optimization 4 (1), 103-114, 2007 | 79 | 2007 |
| 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 |
| 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 | 67 | 2009 |
| A computational study of local search algorithms for Italian high-school timetabling P Avella, B D’Auria, S Salerno, I Vasil’ev Journal of Heuristics 13, 543-556, 2007 | 62 | 2007 |
| A cutting plane algorithm for the capacitated facility location problem P Avella, M Boccia Computational Optimization and Applications 43, 39-65, 2009 | 61 | 2009 |
| Single-period cutting planes for inventory routing problems P Avella, M Boccia, LA Wolsey Transportation Science 52 (3), 497-508, 2018 | 50 | 2018 |
| 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 |
| Logical reduction tests for the p‐problem P Avella, A Sforza Annals of Operations Research 86 (0), 105-115, 1999 | 33 | 1999 |
| 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 |
| 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 |
| Improving ontology alignment through memetic algorithms G Acampora, P Avella, V Loia, S Salerno, A Vitiello 2011 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2011), 1783-1790, 2011 | 29 | 2011 |
| A Steiner arborescence model for the feeder reconfiguration in electric distribution networks P Avella, D Villacci, A Sforza European journal of operational research 164 (2), 505-509, 2005 | 27 | 2005 |
