AVELLA, Pasquale
AVELLA, Pasquale
DIPARTIMENTO DI INGEGNERIA
A Branch-and-Cut algorithm for the Median-Path problem
2005-01-01 Avella, P; Boccia, M; Sforza, A; Vasilyev, I.
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem
2013-01-01 Avella, P; Boccia, M; Vasiliev, I.
A COMPUTATIONAL STUDY OF A CUTTING PLANE ALGORITHM FOR UNIVERSITY COURSE TIMETABLING
2005-01-01 Avella, P; Vasiliev, I.
A computational study of dicut reformulation for the Single Source Capacitated Facility Location problem
2011-01-01 Avella, P; Boccia, M; Salerno, S.
A computational study of exact knapsack separation for the generalized assignment problem
2010-01-01 Boccia, M; Avella, P; Vasilyev, I.
A computational study of local search algorithms for Italian high-school timetabling
2007-01-01 Avella, P; D'Auria, B; Salerno, S; Vasilyev, I.
A cutting plane algorithm for the capacitated facility location problem
2009-01-01 Avella, P; Boccia, M.
A decomposition approach for a very large scale optimal diversity management problem
2005-01-01 Avella, P; Boccia, M; Di Martino, C; Oliviero, G; Sforza, A; Vasilyev, I.
A heuristic for large-scale p-median instances
2003-01-01 Sassano, A.; Avella, P; Vasiliev, I.
A LP-based heuristic for a time-constrained routing problem
2006-01-01 Avella, P; D'Auria, B; Salerno, S.
A steiner arborescence model for the feeder reconfiguration in electric distribution networks.
2005-01-01 Avella, P; Villacci, D; Sforza, A
An aggregation heuristic for large scale p-median problems
2012-01-01 Avella, P; Boccia, M; Salerno, S; Vasilyev, I.
An effective heuristic for large-scale capacitated facility location problems
2009-01-01 Avella, P; Boccia, M; Sforza, A; Vasilyev, I.
An exponential penalty function heuristic for the Resource Constrained Shortest Path Problem
2002-01-01 Avella, P; Boccia, M.; Sforza, A.
An optimization approach for congestion control in network routing with quality of service requirements
2019-01-01 Avella, P.; Bernardi, G.; Boccia, M.; Mattia, S.
Brevetto n.102017000007295 PROCEDIMENTO PER IL BILANCIAMENTO DI PERCORSI DI ROUTING ATTRAVERSO UNA RETE DATI, RELATIVO SISTEMA DI COMUNICAZIONE E PRODOTTO INFORMATICO
2017-01-01 Avella, Pasquale; Giacomo, Bernardi; Maurizio, Boccia; Sara, Mattia
Computational experience with general cutting planes for the Set Covering problem
2009-01-01 Boccia, M; Avella, P; Vasyliev, I.
Computational study of large-scale p-median problems
2007-01-01 Sassano, A; Avella, P; Vasil'Ev, I.
Computational testing of a separation procedure for knapsack sets with a single continuous variable
2012-01-01 Avella, P; Boccia, M; Vasilyiev, I.
Improving ontology alignment through memetic algorithms
2011-01-01 Acampora, G; Avella, P; Loia, V; Salerno, S; Vitiello, A.