ADAMO, TOMMASO
 Distribuzione geografica
Continente #
EU - Europa 679
NA - Nord America 384
AS - Asia 124
AF - Africa 13
Continente sconosciuto - Info sul continente non disponibili 1
Totale 1.201
Nazione #
US - Stati Uniti d'America 382
IE - Irlanda 238
IT - Italia 211
SE - Svezia 103
IN - India 41
DE - Germania 31
CN - Cina 30
UA - Ucraina 29
SG - Singapore 27
HK - Hong Kong 20
CZ - Repubblica Ceca 14
BE - Belgio 13
SN - Senegal 13
FI - Finlandia 12
RU - Federazione Russa 11
GB - Regno Unito 5
RO - Romania 3
CA - Canada 2
ES - Italia 2
JO - Giordania 2
NL - Olanda 2
CH - Svizzera 1
CY - Cipro 1
EU - Europa 1
FR - Francia 1
HU - Ungheria 1
IR - Iran 1
JP - Giappone 1
KR - Corea 1
NO - Norvegia 1
PL - Polonia 1
Totale 1.201
Città #
Dublin 238
Lecce 145
Chandler 105
West Jordan 42
Wayanad 41
Munich 21
Jacksonville 20
Singapore 19
Brno 14
Brussels 13
Dakar 13
Princeton 13
Ann Arbor 11
Helsinki 11
Central District 10
Hong Kong 10
New York 10
Dallas 8
Copertino 7
Des Moines 6
Los Angeles 5
Boardman 4
Lequile 4
St Petersburg 4
Taranto 4
Bari 3
Edinburgh 3
Jinan 3
Ogden 3
Torino 3
Wilmington 3
Amsterdam 2
Guangzhou 2
Hanover 2
London 2
Madrid 2
Mammelzen 2
Moscow 2
Nanjing 2
Nuremberg 2
Saint Petersburg 2
Shanghai 2
Sunnyvale 2
Atlanta 1
Beijing 1
Brooklyn 1
Budapest 1
Cedar Knolls 1
Fairfield 1
Gatchina 1
Gunzenhausen 1
Görwihl 1
Jiaxing 1
Lanzhou 1
Nicosia 1
Ningbo 1
Nizhniy Novgorod 1
Noisy-le-sec 1
Oslo 1
Redmond 1
San Jose 1
Santa Clara 1
Seodaemun-gu 1
Shenyang 1
Stockholm 1
Taiyuan 1
Taizhou 1
Tianjin 1
Timișoara 1
Tokyo 1
Toronto 1
Vancouver 1
Warsaw 1
Yicheng 1
Zurich 1
Totale 852
Nome #
Neighborhood Synthesis from an Ensemble of MIP and CP Models 101
Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model 98
MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration 97
Path and speed optimization for conflict-free pickup and delivery under time windows 87
Lifting the Performance of a Heuristic for the Time-Dependent Travelling Salesman Problem through Machine Learning 87
A learn-and-construct framework for general mixed-integer programming problems 76
null 62
Robust Batch Process Scheduling in Pharmaceutical Industries: A Case Study 61
Properties and bounds for the single-vehicle capacitated routing problem with time-dependent travel times and multiple trips 58
An enhanced lower bound for the Time-Dependent Travelling Salesman Problem 58
Ejection chain moves for automatic neighborhood synthesis in constrained cardinality-minimization problems 50
null 44
null 44
null 44
null 37
On path ranking in time-dependent graphs 27
A multi-modal tourist trip planner integrating road and pedestrian networks 26
null 26
On path ranking in time-dependent graphs 22
Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem 21
A Surprisal-Based Greedy Heuristic for the Set Covering Problem 20
Crop planting layout optimization in sustainable agriculture: A constraint programming approach 17
Ejection chain moves for automatic neighborhood synthesis in constrained cardinality-minimization problems 15
On path ranking in time-dependent graphs 14
An enhanced lower bound for the Time-Dependent Travelling Salesman Problem 13
Real-time schedule adjustments for conflict-free vehicle routing 12
Recovering feasibility in real-time conflict-free vehicle routing 10
A review of recent advances in time-dependent vehicle routing 9
Artificial intelligence and digital reproduction in art 8
Recovering feasibility in real-time conflict-free vehicle routing 7
On path ranking in time-dependent graphs 4
Totale 1.255
Categoria #
all - tutte 6.916
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 6.916


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/202072 0 0 1 4 2 8 19 12 4 1 8 13
2020/2021115 14 0 11 8 16 19 1 10 7 17 2 10
2021/202291 2 2 0 20 23 2 7 5 3 1 10 16
2022/2023531 42 46 15 39 39 29 17 16 265 1 18 4
2023/2024316 10 22 24 15 24 14 2 4 25 120 41 15
2024/202581 41 18 22 0 0 0 0 0 0 0 0 0
Totale 1.255