CRIS Current Research Information System

GALLI, LAURA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 2.537
NA - Nord America 1.533
EU - Europa 790
SA - Sud America 156
Continente sconosciuto - Info sul continente non disponibili 114
AF - Africa 65
OC - Oceania 3
Totale 5.198
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 1.473
VN - Vietnam 850
CN - Cina 661
SG - Singapore 519
IT - Italia 223
HK - Hong Kong 199
BR - Brasile 119
GB - Regno Unito 119
DE - Germania 98
KR - Corea 74
BD - Bangladesh 63
NL - Olanda 60
FR - Francia 54
UA - Ucraina 51
IN - India 45
JP - Giappone 42
SE - Svezia 38
CA - Canada 37
ZA - Sudafrica 37
RU - Federazione Russa 35
FI - Finlandia 23
IE - Irlanda 20
AT - Austria 16
AR - Argentina 15
PH - Filippine 13
TH - Thailandia 13
ID - Indonesia 12
CI - Costa d'Avorio 11
EE - Estonia 10
JO - Giordania 9
PL - Polonia 9
BE - Belgio 7
EC - Ecuador 6
PT - Portogallo 6
CL - Cile 5
CR - Costa Rica 5
CZ - Repubblica Ceca 5
JM - Giamaica 5
MX - Messico 5
NP - Nepal 5
PK - Pakistan 5
IQ - Iraq 4
KE - Kenya 4
MY - Malesia 4
TN - Tunisia 4
TW - Taiwan 4
VE - Venezuela 4
AU - Australia 3
CH - Svizzera 3
ES - Italia 3
SC - Seychelles 3
TR - Turchia 3
CO - Colombia 2
DO - Repubblica Dominicana 2
IL - Israele 2
ML - Mali 2
NO - Norvegia 2
PE - Perù 2
PR - Porto Rico 2
PY - Paraguay 2
AL - Albania 1
AZ - Azerbaigian 1
BB - Barbados 1
BG - Bulgaria 1
BH - Bahrain 1
BY - Bielorussia 1
CY - Cipro 1
DZ - Algeria 1
GE - Georgia 1
GR - Grecia 1
HU - Ungheria 1
IR - Iran 1
LB - Libano 1
LK - Sri Lanka 1
LT - Lituania 1
LY - Libia 1
NI - Nicaragua 1
OM - Oman 1
RS - Serbia 1
SA - Arabia Saudita 1
SI - Slovenia 1
SN - Senegal 1
SV - El Salvador 1
TT - Trinidad e Tobago 1
UG - Uganda 1
UY - Uruguay 1
UZ - Uzbekistan 1
Totale 5.084
Salva come PNG Salva come JPEG
Città #
Singapore 312
Ho Chi Minh City 250
San Jose 238
Hanoi 190
Hong Kong 189
Hefei 161
Ann Arbor 128
Southend 91
Ashburn 80
Santa Clara 80
Beijing 79
Seoul 70
Council Bluffs 59
Bologna 55
Fairfield 55
Dallas 49
Wilmington 41
Los Angeles 37
Houston 36
Jacksonville 35
Woodbridge 35
Da Nang 32
Chandler 31
Haiphong 29
Boardman 28
Cambridge 28
Johannesburg 28
Milan 27
Tokyo 27
Seattle 25
Buffalo 21
Guangzhou 21
Montreal 21
New York 21
Princeton 21
Dublin 20
Frankfurt am Main 17
Lauterbourg 17
Quận Bình Thạnh 17
Shanghai 17
Helsinki 16
Can Tho 15
Bengaluru 14
Rimini 14
Dong Ket 13
Turin 13
Biên Hòa 12
Ha Long 12
Abidjan 11
Hải Dương 11
Ninh Bình 11
Rome 11
São Paulo 11
Vienna 11
Atlanta 10
Falkenstein 10
Nanjing 10
Padova 10
The Dalles 10
Westminster 10
Amman 9
Bắc Giang 9
Hangzhou 9
Munich 9
Nuremberg 9
Orem 9
Shenyang 9
Thái Nguyên 9
Wuhan 9
Bến Tre 8
Hebei 8
Jinan 8
Phoenix 8
Amsterdam 7
Bangkok 7
Belo Horizonte 7
Brooklyn 7
Chicago 7
Huế 7
Lappeenranta 7
Minamishinagawa 7
Quận Một 7
Thái Bình 7
Mülheim 6
Quảng Ninh 6
Redondo Beach 6
San Francisco 6
Berlin 5
Charlotte 5
Chengdu 5
Dearborn 5
Ituiutaba 5
Jakarta 5
Medford 5
Nanchang 5
Phủ Lý 5
Saint Petersburg 5
Vĩnh Long 5
Xi'an 5
Zhengzhou 5
Totale 3.225
Salva come PNG Salva come JPEG
Nome #
An Electromagnetism Metaheuristic for the Unicost Set Covering Problem 641
Railway Rolling Stock Planning: Robustness Against Large Disruptions 260
A tutorial on non-periodic train timetabling and platforming problems 259
Recoverable Robustness for Railway Rolling Stock Planning 193
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem 185
Lagrangian Approaches for QoS Scheduling in Computer Networks 166
The quadratic knapsack problem 164
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem 161
Recovery-Robust Platforming by Network Buffering 159
Solution of the Train Platforming Problem 156
The quadratic knapsack problem with setup 154
Delay-Robust Event Scheduling 154
A MILP approach to DRAM access worst-case analysis 144
Robust Train Routing and Online Re-scheduling 137
On upper bounds for the multiple knapsack assignment problem 136
Solution of the Train Platforming Problem 136
Recoverable Robustness for Scheduling with Precedence Constraints 131
A separation algorithm for the simple plant location problem 126
Valid inequalities for quadratic optimisation with domain constraints 118
A lagrangian approach to chance constrained routing with local broadcast 87
Optimization methods: An applications-oriented primer 71
Demand uncertainty in robust Home Care optimization 69
Bi-dimensional Assignment in 5G Periodic Scheduling 68
A matheuristic for integrated timetabling and vehicle scheduling 66
Gap inequalities for the max-cut problem: A cutting-plane algorithm 63
Combinatorial and robust optimisation models and algorithms for railway applications 62
On the Lovász theta function and some variants 60
Modern Challenges in Timetabling 60
Delay-constrained shortest paths: approximation algorithms and second-order cone models 56
Small bipartite subgraph polytopes 56
Minimizing power consumption in virtualized cellular networks 55
Delay Constrained Routing: the Multi-flow Single-Path Case 55
QoS Routing with worst-case delay constraints: models, algorithms and performance analysis 53
A testbed for flexible and energy-efficient resource management with virtualized LTE-A nodes 53
A lagrangian heuristic for integrated timetabling and vehicle scheduling 52
New valid inequalities and facets for the Simple Plant Location Problem 51
Gap Inequalities for Non-Convex Mixed-Integer Quadratic Programs 50
Optimal joint path computation and rate allocation for real-time traffic 49
A compact variant of the QCR method for quadratically constrained quadratic 01 programs 49
A Tool for Practical Integrated Time-Table Design and Vehicle Scheduling in Public Transport Systems 48
A binarisation heuristic for non-convex quadratic programming with box constraints 47
Towards Robust Admission Control in Delay-Constrained Routing Problems 45
Delay-constrained Routing Problems: Accurate Scheduling Models and Admission Control 44
Complexity results for the gap inequalities for the max-cut problem 44
Scalability and energy efficiency of Coordinated Scheduling in cellular networks towards 5G 42
Strong formulations for the multi-module PESP and a quadratic algorithm for graphical diophantine equation systems 42
Flexible dynamic Coordinated Scheduling in Virtual-RAN deployments 42
Modeling with stochastic programming, Alan J. King and Stein W. Wallace 40
Practical feasibility, scalability and effectiveness of coordinated scheduling algorithms in cellular networks towards 5G 39
Totale 5.198
Salva come PNG Salva come JPEG
Categoria #
all - tutte 12.396
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 12.396
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022245 0 7 20 29 30 23 18 26 18 6 35 33
2022/2023169 18 20 14 16 9 8 7 6 41 3 23 4
2023/202437 3 10 3 5 3 4 2 0 2 3 1 1
2024/20251.041 7 33 73 74 111 42 218 41 66 70 79 227
2025/20263.008 182 673 259 171 223 77 224 123 497 213 207 159
2026/2027136 72 64 0 0 0 0 0 0 0 0 0 0
Totale 5.198