Sfoglia per Autore  

Opzioni
Mostrati risultati da 1 a 20 di 35
Titolo Data di pubblicazione Autore(i) File
Some personal views on the current state and the future of Locational Analysis 1-gen-1998 Avella, P; Benati, S; Cánovas Martinez, L; Dalby, K; Di Girolamo, D; Dimitrijevic, B; Ghiani, G; Giannikos, I; Guttmann, N; Hultberg, T; Fliege, J; Marin, A; Munõz Márquez, M; Ndiaye, M; Nickel, S; Peeters, P; Pérez Brito, D; Policastro, S; Saldanha De Gama, Fa; Zidda, P.
Logical reduction tests for the p-median problem 1-gen-1999 Avella, P; Sforza, A.
ON THE p-MEDIAN POLYTOPE 1-gen-2001 Avella, P; Sassano, A.
An exponential penalty function heuristic for the Resource Constrained Shortest Path Problem 1-gen-2002 Avella, P; Boccia, M.; Sforza, A.
A heuristic for large-scale p-median instances 1-gen-2003 Sassano, A.; Avella, P; Vasiliev, I.
Solving a fuel delivery problem by heuristic and exact approaches 1-gen-2004 Avella, P; Boccia, M; Sforza, A.
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management 1-gen-2004 Avella, P; Boccia, M; Sforza, A.
Metric Inequalities and the Netowrk Loading Problem 1-gen-2004 Avella, P; Mattia, S; Sassano, A.
Near-optimal solutions of large-scale Single Machine Scheduling problems with release dates 1-gen-2005 Avella, Pasquale; Boccia, M.; D'Auria, B.
A Branch-and-Cut algorithm for the Median-Path problem 1-gen-2005 Avella, P; Boccia, M; Sforza, A; Vasilyev, I.
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 steiner arborescence model for the feeder reconfiguration in electric distribution networks. 1-gen-2005 Avella, P; Villacci, D; Sforza, A
A COMPUTATIONAL STUDY OF A CUTTING PLANE ALGORITHM FOR UNIVERSITY COURSE TIMETABLING 1-gen-2005 Avella, P; Vasiliev, I.
A LP-based heuristic for a time-constrained routing problem 1-gen-2006 Avella, P; D'Auria, B; Salerno, S.
Metric Inequalities and the Network Loading Problem 1-gen-2007 Avella, P; Mattia, S; Sassano, A.
A computational study of local search algorithms for Italian high-school timetabling 1-gen-2007 Avella, P; D'Auria, B; Salerno, S; Vasilyev, I.
Computational study of large-scale p-median problems 1-gen-2007 Sassano, A; Avella, P; Vasil'Ev, I.
Computational experience with general cutting planes for the Set Covering problem 1-gen-2009 Boccia, M; Avella, P; Vasyliev, I.
A cutting plane algorithm for the capacitated facility location problem 1-gen-2009 Avella, P; Boccia, M.
An effective heuristic for large-scale capacitated facility location problems 1-gen-2009 Avella, P; Boccia, M; Sforza, A; Vasilyev, I.
Mostrati risultati da 1 a 20 di 35
Legenda icone

  •  file ad accesso aperto
  •  file disponibili sulla rete interna
  •  file disponibili agli utenti autorizzati
  •  file disponibili solo agli amministratori
  •  file sotto embargo
  •  nessun file disponibile