Montemanni, Roberto
 Distribuzione geografica
Continente #
NA - Nord America 17.029
AS - Asia 10.271
EU - Europa 6.175
SA - Sud America 1.538
Continente sconosciuto - Info sul continente non disponibili 442
AF - Africa 226
OC - Oceania 31
Totale 35.712
Nazione #
US - Stati Uniti d'America 16.677
SG - Singapore 3.549
CN - Cina 2.341
GB - Regno Unito 1.447
HK - Hong Kong 1.317
IT - Italia 1.263
BR - Brasile 1.192
VN - Vietnam 990
SE - Svezia 710
DE - Germania 570
IN - India 421
RU - Federazione Russa 405
TR - Turchia 356
FR - Francia 336
PL - Polonia 313
KR - Corea 302
FI - Finlandia 277
BD - Bangladesh 251
BG - Bulgaria 177
CA - Canada 166
ID - Indonesia 144
UA - Ucraina 129
AR - Argentina 111
MX - Messico 96
NL - Olanda 82
JP - Giappone 81
IQ - Iraq 78
IE - Irlanda 75
CH - Svizzera 61
CO - Colombia 54
ZA - Sudafrica 53
EC - Ecuador 51
ES - Italia 51
TH - Thailandia 45
PK - Pakistan 44
BE - Belgio 43
CL - Cile 40
LT - Lituania 38
MY - Malesia 38
MA - Marocco 37
IR - Iran 36
EG - Egitto 32
RO - Romania 32
PH - Filippine 31
JO - Giordania 29
AE - Emirati Arabi Uniti 27
SA - Arabia Saudita 26
UZ - Uzbekistan 26
VE - Venezuela 26
AT - Austria 25
PE - Perù 25
AU - Australia 24
PT - Portogallo 21
TN - Tunisia 21
CZ - Repubblica Ceca 20
PY - Paraguay 20
DZ - Algeria 17
KE - Kenya 16
NP - Nepal 15
AZ - Azerbaigian 14
DK - Danimarca 14
UY - Uruguay 14
JM - Giamaica 12
LB - Libano 12
CR - Costa Rica 11
CU - Cuba 11
GR - Grecia 11
KZ - Kazakistan 11
AL - Albania 10
HN - Honduras 10
SK - Slovacchia (Repubblica Slovacca) 10
TW - Taiwan 10
IL - Israele 9
NO - Norvegia 9
PA - Panama 9
BH - Bahrain 8
CI - Costa d'Avorio 7
ET - Etiopia 7
LK - Sri Lanka 7
NG - Nigeria 7
NI - Nicaragua 7
QA - Qatar 7
SN - Senegal 7
TT - Trinidad e Tobago 7
CY - Cipro 6
DO - Repubblica Dominicana 6
GT - Guatemala 6
HU - Ungheria 6
KG - Kirghizistan 6
NZ - Nuova Zelanda 6
PS - Palestinian Territory 6
BA - Bosnia-Erzegovina 5
EE - Estonia 5
KH - Cambogia 5
OM - Oman 5
RS - Serbia 5
GE - Georgia 4
LV - Lettonia 4
MD - Moldavia 4
SI - Slovenia 4
Totale 35.204
Città #
Santa Clara 2.009
Singapore 1.987
Ashburn 1.833
Fairfield 1.795
Hong Kong 1.287
San Jose 751
Chandler 735
Woodbridge 703
Seattle 677
Southend 662
Wilmington 616
Cambridge 613
Houston 613
Hefei 556
London 555
Nyköping 425
Dearborn 424
Beijing 362
Ho Chi Minh City 318
The Dalles 318
Warsaw 298
Ann Arbor 297
Seoul 281
Hanoi 266
Los Angeles 243
Izmir 236
Council Bluffs 234
Dallas 234
Helsinki 228
Milan 219
San Diego 210
Mumbai 195
Princeton 181
Sofia 173
Lauterbourg 167
Chicago 149
Eugene 144
São Paulo 128
Buffalo 121
New York 118
Berlin 111
Moscow 110
Shanghai 105
Modena 96
Jakarta 80
Bologna 73
Dublin 70
Guangzhou 66
Redondo Beach 61
Orem 58
Redwood City 58
Columbus 55
Atlanta 53
Frankfurt am Main 50
Salt Lake City 47
Da Nang 44
Tokyo 44
Boardman 43
Rome 42
Yalova 41
Amsterdam 40
Munich 37
Tampa 36
Falls Church 34
Brooklyn 32
Brussels 31
Kent 31
Baghdad 30
Des Moines 30
Haiphong 30
Norwalk 30
Toronto 30
Denver 29
Mexico City 29
Rio de Janeiro 29
Chennai 28
Montreal 28
Ottawa 28
San Francisco 28
Nanjing 27
Grafing 26
Lappeenranta 26
Phoenix 26
Curitiba 25
Denton 25
Dhaka 24
Johannesburg 24
Istanbul 23
Miano 23
Parma 23
Jacksonville 22
Tashkent 22
Belo Horizonte 21
Hải Dương 21
Bari 20
Biên Hòa 20
Elk Grove Village 20
Lancaster 20
New Delhi 20
Bengaluru 19
Totale 23.735
Nome #
1 A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem 1.003
A metaheuristic algorithm for the probabilistic orienteering problem 555
Industrial cluster optimization based on linear programming 439
Solving the maximum clique problem with a hybrid algorithm 304
Industrial Cluster Symbiosis Optimisation Based on Linear Programming 300
Machine Learning Approaches for the Traveling Salesman Problem: A Survey 284
A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem 271
Solving the sequential ordering problem using branch and bound 262
A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem 261
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem 258
Algorithms based on Branch and Bound for the Flying Sidekick Traveling Salesman Problem 253
A branch and bound algorithm for the robust spanning tree problem with interval data 250
A Benders decomposition approach for the robust spanning tree problem with interval data 246
A comparison of two exact algorithms for the sequential ordering problem 245
Modeling the Flying Sidekick Traveling Salesman Problem with Multiple Drones 243
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem 241
A Mixed Integer Linear Program for a Precedence-Constrained Minimum-Cost Arborescence Problem 237
Steepest ant sense algorithm for parameter optimisation of multi-response processes based on taguchi design 236
OmicsNet: Integration of Multi-Omics Data using Path Analysis in Multilayer Networks 236
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks 234
The robust shortest path problem with interval data via Benders decomposition 232
Ant colony systems for large sequential ordering problems 232
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem 231
A branch and bound approach to permutation codes 231
A fast prize-collecting steiner forest algorithm for functional analyses in biological networks 230
Exact models for the flying sidekick traveling salesman problem 226
A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics 225
Hyperparameter search in periodic vehicle routing problem 224
PCSF: An R-package for network-based interpretation of high-throughput data 223
Maximum Independent Sets and Supervised Learning 222
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling 218
Monte Carlo Sampling for the Probabilistic Orienteering Problem 217
A Multi-Modal and Multi-Objective Journey Planner for Integrating Carpooling and Public Transport 217
A branch and bound algorithm for the robust shortest path problem with interval data 217
Ant colony system for a dynamic vehicle routing problem 217
Ant colony optimization for real-world vehicle routing problems 216
A new table of permutation codes 214
A Tabu Search algorithm for the Probabilistic Orienteering Problem 214
Permutation Codes, Hamming Graphs and Turan Graphs 213
Skill-Based Joint Order Batching and Picker Routing Problem 211
Stochastic Search in Metaheuristics 210
A matheuristic algorithm for a large-scale energy management problem 210
3-opt Metaheuristics for the Probabilistic Orienteering Problem 209
Time dependent vehicle routing problem with a multi ant colony system 207
Coupling ant colony systems with strong local searches 204
A hybrid particle swarm optimization approach for the sequential ordering problem 203
An ant colony system for the capacitated vehicle routing problem with uncertain travel costs 199
Green Bullwhip Effect Cost Simulation in Distribution Networks 199
Notice of Removal: Reinforcement Learning and Additional Rewardsfor the Traveling Salesman Problem 198
Machine learning and monte carlo sampling for the probabilistic orienteering problem 198
Minimum power multicasting in wireless networks under probabilistic node failures 196
A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines 194
Artificial intelligence for healthcare and rescuing technology: technical developments and thoughts about employment impacts 193
A Hybrid Meta heuristic Algorithm for the Balanced Line Production under Uncertainty 192
A robust multiple ant colony system for the capacitated vehicle routing problem 191
The robust traveling salesman problem with interval data 190
A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data 190
Permutation codes with specified packing radius 190
A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks 189
Frequency assignment, multiple interference and binary constraints 189
An enhanced ant colony system for the probabilistic traveling salesman problem 188
A prize-collecting Steiner tree application for signature selection to stratify diffuse large B-cell lymphoma subtypes 187
Ant colony optimisation for a 2-stage capacitated vehicle routing problem with probabilistic demand increases 186
Hardness results for the probabilistic traveling salesman problem with deadlines 185
Tour planning and ride matching for an urban social carpooling service 185
Aggregate blending via robust linear programming 182
The minimum power broadcast problem in wireless networks: a simulated annealing approach 182
Software support for sustainable supply chain configuration and management 182
Mathematical programming models for home healthcare service optimisation 181
A Constraint Programming Model for the B-Coloring Problem 178
An ANTS algorithm for the minimum span frequency assignment problem with multiple interference 178
The Orienteering Problem with Stochastic Travel and Service: Times New approaches to sampling-based objective function evaluation 178
Models and Algorithms for the MPSCP: An Overview Roberto Montemanni, Luca M. Gambardella, and Arindam Kumar Das 177
Integrated home health care optimization via genetic algorithms and mathematical programming 176
The Picking and Packing Problem in Buy-Online-Pick-up-in-Store Retailing 175
An exact algorithm for the robust shortest path problem with interval data 175
An improved heuristic for the probabilistic traveling salesman problem with deadlines based on GPGPU 175
Wireless multicasting under probabilistic node failures: a heuristic approach 174
Challenges and opportunities in deploying a mobility platform integrating public transport and car-pooling services 174
A Benders decomposition approach for the robust shortest path problem with interval data 174
Comparison of Objective Function Evaluators for a Stochastic Orienteering Problem 174
A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times 173
In-store Picking Strategies for Online Orders in Grocery Retail Logistics 173
Ergonomics and Storage Base Position for U-shaped Picking Zones 172
AMR-Assisted Order Picking: Models for Picker-to-Parts Systems in a Two-Blocks Warehouse 172
Swarm approach for a connectivity problem in wireless networks 172
Graph colouring and branch and bound approaches for permutation code algorithms 171
Hamming Graphs and Permutation Codes 171
Power-aware distributed protocol for a connectivity problem in wireless sensor networks 170
The design of permutation codes via a specialized maximum clique algorithm 170
Correlations Between Experimentally-Determined Melting Temperatures and GC-Content for Short DNA Strands 170
A decision support tool for intelligent manufacturing systems via an elevator kinematic optimisation based method 169
Setting the Configuration Parameters of the Algorithm for the Periodic Vehicle Routing Problem by HPC Power 167
Precedence-Constrained arborescences 166
The Use of an Exact Algorithm Within a Tabu Search Maximum Clique Algorithm 166
Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach 166
An enhanced ant colony system for the sequential ordering problem 166
Ant Colony Optimisation for vehicle routing problems: from theory to applications 166
A sampling-based metaheuristic for the Orienteering Problem with Stochastic Travel Times 165
A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem” 164
Totale 21.714
Categoria #
all - tutte 154.457
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 154.457


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20223.229 188 298 289 142 94 217 164 157 395 254 635 396
2022/20232.778 389 177 204 197 304 349 161 250 430 100 139 78
2023/20242.247 75 103 106 306 403 83 78 632 59 85 103 214
2024/20257.478 412 136 87 476 1.261 1.028 306 497 974 796 761 744
2025/202612.017 594 503 1.323 1.200 1.081 1.218 1.611 674 953 1.620 644 596
2026/2027537 537 0 0 0 0 0 0 0 0 0 0 0
Totale 35.712