Pasquale Avella
Pasquale Avella
Verified email at unisannio.it
Title
Cited by
Cited by
Year
Computational study of large-scale p-median problems
P Avella, A Sassano, I Vasil'ev
Mathematical Programming 109 (1), 89-114, 2007
2302007
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
1572004
On the p-median polytope
P Avella, A Sassano
Mathematical Programming 89 (3), 395-411, 2001
822001
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
812012
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
812005
Metric inequalities and the network loading problem
P Avella, S Mattia, A Sassano
Discrete Optimization 4 (1), 103-114, 2007
722007
A computational study of exact knapsack separation for the generalized assignment problem
P Avella, M Boccia, I Vasilyev
Computational Optimization and Applications 45 (3), 543-555, 2010
602010
Some personal views on the current state and the future of locational analysis
P Avella, S Benati, LC Martinez, K Dalby, D Di Girolamo, B Dimitrijevic, ...
European Journal of Operational Research 104 (2), 269-287, 1998
601998
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 (6), 543-556, 2007
542007
An effective heuristic for large-scale capacitated facility location problems
P Avella, M Boccia, A Sforza, I Vasil’ev
Journal of Heuristics 15 (6), 597, 2009
532009
A cutting plane algorithm for the capacitated facility location problem
P Avella, M Boccia
Computational Optimization and Applications 43 (1), 39-65, 2009
432009
Logical reduction tests for the p‐problem
P Avella, A Sforza
Annals of Operations Research 86, 105-115, 1999
341999
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), 1-17, 2004
312004
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
302005
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
302002
Single-period cutting planes for inventory routing problems
P Avella, M Boccia, LA Wolsey
Transportation science 52 (3), 497-508, 2018
252018
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
242005
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
232009
A decomposition approach for a very large scale optimal diversity management problem
P Avella, M Boccia, C Di Martino, G Oliviero, A Sforza, I Vasil’ev
4OR 3 (1), 23-37, 2005
212005
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
202015
The system can't perform the operation now. Try again later.
Articles 1–20