CINECA IRIS Institutional Research Information System

GALLI, LAURA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.758
EU - Europa 1.091
AS - Asia 361
AF - Africa 67
SA - Sud America 8
OC - Oceania 6
Totale 4.291
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.723
IT - Italia 516
SE - Svezia 194
CN - Cina 151
BG - Bulgaria 90
DE - Germania 82
SG - Singapore 74
GB - Regno Unito 70
VN - Vietnam 60
CI - Costa d'Avorio 44
CA - Canada 35
FI - Finlandia 33
HK - Hong Kong 21
SN - Senegal 19
NL - Olanda 16
RU - Federazione Russa 16
BE - Belgio 15
JP - Giappone 12
UA - Ucraina 12
TR - Turchia 11
FR - Francia 9
AU - Australia 6
GR - Grecia 6
IE - Irlanda 6
PL - Polonia 6
BR - Brasile 5
ES - Italia 5
ID - Indonesia 5
IN - India 5
MY - Malesia 5
TW - Taiwan 5
HU - Ungheria 4
PK - Pakistan 4
CH - Svizzera 3
KR - Corea 3
PT - Portogallo 3
CL - Cile 2
DK - Danimarca 2
IR - Iran 2
NG - Nigeria 2
ZA - Sudafrica 2
AT - Austria 1
BD - Bangladesh 1
CO - Colombia 1
EE - Estonia 1
NO - Norvegia 1
PH - Filippine 1
TH - Thailandia 1
Totale 4.291
Salva come PNG Salva come JPEG
Città #
Woodbridge 458
Fairfield 367
Ann Arbor 309
Houston 264
Serra 230
Ashburn 213
Seattle 150
Wilmington 132
Cambridge 122
Chandler 99
Sofia 90
New York 68
Princeton 54
Bondeno 48
Abidjan 44
Beijing 43
Lawrence 40
Medford 35
Lancaster 32
Ottawa 32
Des Moines 31
Florence 31
Crespellano 29
Dong Ket 27
Nanjing 24
Singapore 24
Dakar 19
Dearborn 19
San Diego 17
Los Angeles 16
Brussels 14
Frankfurt am Main 14
Falls Church 12
Hong Kong 12
Jacksonville 12
Mountain View 11
Tokyo 11
Boardman 10
Indiana 10
Pistoia 10
Ciampino 9
Pisa 9
Redwood City 9
Washington 9
Ogden 8
Helsinki 7
Shanghai 7
Aachen 6
Bologna 6
Castel San Pietro Terme 6
Torino 6
Chengdu 5
Düsseldorf 5
Guangzhou 5
Hebei 5
Hefei 5
Nanchang 5
Norwalk 5
Rome 5
San Vincenzo 5
Shenyang 5
Taipei 5
Viareggio 5
Wroclaw 5
Boulder 4
Moscow 4
Phoenix 4
Piemonte 4
Treviso 4
Auburn Hills 3
Dallas 3
Fremont 3
Gandía 3
Hangzhou 3
Izmir 3
Jinan 3
Karlsruhe 3
Kunming 3
London 3
Milan 3
Augusta 2
Bayan Lepas 2
Changsha 2
Council Bluffs 2
Deland 2
Delft 2
Dongdaemun-gu 2
Egham 2
Erlangen 2
Foggia 2
Jiaxing 2
Johannesburg 2
Königsbronn 2
La Spezia 2
Lanzhou 2
Lauda-Konigshofen 2
Lucca 2
Munich 2
Oria 2
Pinzolo 2
Totale 3.423
Salva come PNG Salva come JPEG
Nome #
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G 254
Recoverable robustness for railway rolling stock planning 186
Minimizing power consumption in virtualized cellular networks 163
Optimal joint path computation and rate allocation for real-time traffic 163
A testbed for flexible and energy-efficient resource management with virtualized LTE-A nodes 158
Delay-constrained Routing Problems: Accurate Scheduling Models and Admission Control 141
Flexible dynamic Coordinated Scheduling in Virtual-RAN deployments 138
QoS Routing with worst-case delay constraints: models, algorithms and performance analysis 137
Scalability and energy efficiency of Coordinated Scheduling in cellular networks towards 5G 137
Delay-constrained shortest paths: approximation algorithms and second-order cone models 136
Railway rolling stock planning: robustness against large disruptions 131
Combinatorial and robust optimisation models and algorithms for railway applications 126
Gap inequalities for the max-cut problem: a cutting-plane algorithm 124
Demand uncertainty in robust Home Care optimization 124
Solution of the train platforming problem 123
Towards Robust Admission Control in Delay-Constrained Routing Problems 122
A matheuristic for integrated timetabling and vehicle scheduling 116
Strong formulations for the multi-module PESP and a quadratic algorithm for graphical diophantine equation systems 115
Complexity results for the gap inequalities for the max-cut problem 115
On the Lovász theta function and some variants 113
An electromagnetism metaheuristic for the unicost set covering problem 111
Small bipartite subgraph polytopes 108
New valid inequalities and facets for the Simple Plant Location Problem 108
Delay-robust event scheduling 105
Gap inequalities for non-convex mixed-integer quadratic programs 104
A compact variant of the QCR method for quadratically constrained quadratic 01 programs 98
A tutorial on non-periodic train timetabling and platforming problems 98
A Tool for Practical Integrated Time-Table Design and Vehicle Scheduling in Public Transport Systems 92
Modeling with stochastic programming, Alan J. King and Stein W. Wallace. 91
Solution of the Train Platforming Problem 88
Modern Challenges in Timetabling 83
A binarisation heuristic for non-convex quadratic programming with box constraints 82
A Lagrangian approach to Chance Constrained Routing with Local Broadcast 80
Recovery-robust platforming by network buffering 79
A MILP Approach to DRAM Access Worst-Case Analysis 71
Recoverable robustness for scheduling with precedence constraints 69
Robust train routing and online re-scheduling 61
Optimization Methods: An Applications-Oriented Primer 59
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem 53
Valid inequalities for quadratic optimisation with domain constraints 24
A separation algorithm for the simple plant location problem 24
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem 11
null 9
Bi-dimensional Assignment in 5G Periodic Scheduling 6
Lagrangian approaches for QoS scheduling in computer networks 4
A lagrangian heuristic for integrated timetabling and vehicle scheduling 4
On upper bounds for the multiple knapsack assignment problem 2
Totale 4.546
Salva come PNG Salva come JPEG
Categoria #
all - tutte 11.310
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 11.310
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.000 91 51 169 86 86 108 106 79 93 65 38 28
2020/2021550 25 35 19 14 24 45 16 45 151 59 36 81
2021/2022578 25 31 13 30 102 85 15 31 42 44 41 119
2022/2023482 65 34 39 20 44 78 10 28 108 1 41 14
2023/2024404 19 23 52 21 77 97 6 12 13 18 17 49
2024/20256 6 0 0 0 0 0 0 0 0 0 0 0
Totale 4.546