AVELLA, Pasquale

AVELLA, Pasquale  

DIPARTIMENTO DI INGEGNERIA  

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