Montemanni, Roberto
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 10.056
EU - Europa 3.330
AS - Asia 2.378
SA - Sud America 74
OC - Oceania 20
AF - Africa 16
Continente sconosciuto - Info sul continente non disponibili 4
Totale 15.878
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 9.979
GB - Regno Unito 845
IT - Italia 703
SE - Svezia 611
SG - Singapore 611
CN - Cina 550
HK - Hong Kong 434
DE - Germania 317
TR - Turchia 261
IN - India 259
BG - Bulgaria 173
FI - Finlandia 119
FR - Francia 114
UA - Ucraina 102
IE - Irlanda 64
CA - Canada 58
CH - Svizzera 54
JP - Giappone 45
BE - Belgio 39
BR - Brasile 39
ID - Indonesia 37
VN - Vietnam 36
IR - Iran 33
NL - Olanda 30
TH - Thailandia 30
LT - Lituania 29
MY - Malesia 27
RO - Romania 25
RU - Federazione Russa 18
AU - Australia 17
CO - Colombia 17
CZ - Repubblica Ceca 17
KR - Corea 16
JO - Giordania 14
CU - Cuba 11
ES - Italia 11
PT - Portogallo 11
CL - Cile 10
PL - Polonia 8
GR - Grecia 7
MX - Messico 7
NO - Norvegia 7
DK - Danimarca 6
TW - Taiwan 6
AT - Austria 5
PE - Perù 5
IQ - Iraq 4
MA - Marocco 4
NG - Nigeria 4
PH - Filippine 4
AR - Argentina 3
BA - Bosnia-Erzegovina 3
NZ - Nuova Zelanda 3
PK - Pakistan 3
A2 - ???statistics.table.value.countryCode.A2??? 2
HU - Ungheria 2
LK - Sri Lanka 2
MD - Moldavia 2
ME - Montenegro 2
QA - Qatar 2
SA - Arabia Saudita 2
SI - Slovenia 2
SK - Slovacchia (Repubblica Slovacca) 2
ZA - Sudafrica 2
A1 - Anonimo 1
AE - Emirati Arabi Uniti 1
BZ - Belize 1
CI - Costa d'Avorio 1
DZ - Algeria 1
EE - Estonia 1
EG - Egitto 1
EU - Europa 1
KE - Kenya 1
LB - Libano 1
LV - Lettonia 1
MU - Mauritius 1
TN - Tunisia 1
Totale 15.878
Salva come PNG Salva come JPEG
Città #
Fairfield 1.794
Ashburn 1.137
Chandler 735
Woodbridge 703
Seattle 665
Southend 662
Cambridge 613
Wilmington 606
Houston 601
Nyköping 425
Dearborn 423
Hong Kong 416
Singapore 409
Ann Arbor 297
Izmir 235
San Diego 199
Mumbai 185
Princeton 181
Sofia 172
Beijing 164
Eugene 144
Helsinki 109
Milan 80
Modena 76
Shanghai 65
Dublin 63
Redwood City 58
London 56
Guangzhou 51
Falls Church 34
Bologna 33
Dallas 33
Jakarta 33
Norwalk 30
Hanoi 29
Los Angeles 29
Brussels 28
New York 27
Ottawa 27
Grafing 26
Nanjing 24
Parma 18
Bengaluru 17
Jacksonville 17
Des Moines 16
Hefei 16
Bari 15
Kilburn 14
Santa Clara 14
Amsterdam 13
Buffalo 13
Tokyo 13
Brno 12
Hounslow 11
Jinan 11
La Habana 11
Southampton 11
Bangkok 10
Kunming 10
Lappeenranta 10
Rome 10
Toronto 10
Udine 10
Bogotá 9
Chiswick 9
Forlì 9
Istanbul 9
Lugano 9
Wuhan 9
Xian 9
Chicago 8
Cologne 8
Eindhoven 8
Matosinhos 8
Mountain View 8
Napoli 8
Sydney 8
Bibbiano 7
Gelsenkirchen 7
Munich 7
Reggio Emilia 7
Shenzhen 7
Tehran 7
Chengdu 6
Concepción 6
Dong Ket 6
Menlo Park 6
Paris 6
Seoul 6
Vigevano 6
West Jordan 6
Berlin 5
Boardman 5
Dalmine 5
Fuzhou 5
Hanover 5
Lima 5
Prescot 5
Redmond 5
San Jose 5
Totale 12.213
Salva come PNG Salva come JPEG
Nome #
A metaheuristic algorithm for the probabilistic orienteering problem 473
Industrial cluster optimization based on linear programming 340
Solving the maximum clique problem with a hybrid algorithm 234
1 A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem 225
Machine Learning Approaches for the Traveling Salesman Problem: A Survey 164
PCSF: An R-package for network-based interpretation of high-throughput data 159
OmicsNet: Integration of Multi-Omics Data using Path Analysis in Multilayer Networks 152
Steepest ant sense algorithm for parameter optimisation of multi-response processes based on taguchi design 148
Industrial Cluster Symbiosis Optimisation Based on Linear Programming 147
Monte Carlo Sampling for the Probabilistic Orienteering Problem 138
A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem 137
Stochastic Search in Metaheuristics 137
A Multi-Modal and Multi-Objective Journey Planner for Integrating Carpooling and Public Transport 134
Algorithms based on Branch and Bound for the Flying Sidekick Traveling Salesman Problem 129
A prize-collecting Steiner tree application for signature selection to stratify diffuse large B-cell lymphoma subtypes 128
Green Bullwhip Effect Cost Simulation in Distribution Networks 124
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling 122
Ant colony systems for large sequential ordering problems 121
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem 121
Hyperparameter search in periodic vehicle routing problem 120
A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem 120
A hybrid particle swarm optimization approach for the sequential ordering problem 118
An ant colony system for the capacitated vehicle routing problem with uncertain travel costs 117
A fast prize-collecting steiner forest algorithm for functional analyses in biological networks 117
A Hybrid Meta heuristic Algorithm for the Balanced Line Production under Uncertainty 116
A Mixed Integer Linear Program for a Precedence-Constrained Minimum-Cost Arborescence Problem 114
Modeling the Flying Sidekick Traveling Salesman Problem with Multiple Drones 114
An enhanced ant colony system for the probabilistic traveling salesman problem 113
Tour planning and ride matching for an urban social carpooling service 113
A branch and bound approach to permutation codes 112
Mathematical programming models for home healthcare service optimisation 112
Ant colony system for a dynamic vehicle routing problem 112
Artificial intelligence for healthcare and rescuing technology: technical developments and thoughts about employment impacts 112
An ANTS algorithm for the minimum span frequency assignment problem with multiple interference 111
Maximum Independent Sets and Supervised Learning 111
Models and Algorithms for the MPSCP: An Overview Roberto Montemanni, Luca M. Gambardella, and Arindam Kumar Das 111
A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks 110
Ant colony optimisation for a 2-stage capacitated vehicle routing problem with probabilistic demand increases 110
A Benders decomposition approach for the robust spanning tree problem with interval data 110
Solving the sequential ordering problem using branch and bound 110
The robust traveling salesman problem with interval data 109
A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines 109
A comparison of two exact algorithms for the sequential ordering problem 109
Wireless multicasting under probabilistic node failures: a heuristic approach 108
Ant colony optimization for real-world vehicle routing problems 108
A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times 107
Setting the Configuration Parameters of the Algorithm for the Periodic Vehicle Routing Problem by HPC Power 107
Aggregate blending via robust linear programming 106
Coupling ant colony systems with strong local searches 106
A new table of permutation codes 106
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem 106
Minimum power multicasting in wireless networks under probabilistic node failures 105
The robust shortest path problem with interval data via Benders decomposition 103
A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem” 102
The design of permutation codes via a specialized maximum clique algorithm 102
Correlations Between Experimentally-Determined Melting Temperatures and GC-Content for Short DNA Strands 102
Permutation Codes, Hamming Graphs and Turan Graphs 102
Software support for sustainable supply chain configuration and management 102
An exact algorithm for the robust shortest path problem with interval data 101
A matheuristic algorithm for a large-scale energy management problem 101
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks 100
A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data 100
An improved heuristic for the probabilistic traveling salesman problem with deadlines based on GPGPU 99
Hamming Graphs and Permutation Codes 98
Time dependent vehicle routing problem with a multi ant colony system 98
An Exact algorithm for the minimum power multicasting problem in wireless sensor networks 98
The Orienteering Problem with Stochastic Travel and Service: Times New approaches to sampling-based objective function evaluation 97
Some valid inequalities for the probabilistic minimum power multicasting problem 96
Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm 94
A robust multiple ant colony system for the capacitated vehicle routing problem 93
Hardness results for the probabilistic traveling salesman problem with deadlines 93
Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach 93
A Tabu Search algorithm for the Probabilistic Orienteering Problem 93
Frequency assignment, multiple interference and binary constraints 92
Comparison of Objective Function Evaluators for a Stochastic Orienteering Problem 92
Graph colouring and branch and bound approaches for permutation code algorithms 91
Monte Carlo sampling for the tourist trip design problem 91
An enhanced ant colony system for the team orienteering problem with time windows 90
A sampling-based metaheuristic for the Orienteering Problem with Stochastic Travel Times 90
Using statistical tests for improving state-of-the-art heuristics for the probabilistic traveling salesman problem with deadlines 90
Integrated home health care optimization via genetic algorithms and mathematical programming 89
Vehicle routing for exhausted oil collection 89
A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics 88
Permutation codes with specified packing radius 88
A branch and bound algorithm for the robust spanning tree problem with interval data 88
Power-aware distributed protocol for a connectivity problem in wireless sensor networks 87
3-opt Metaheuristics for the Probabilistic Orienteering Problem 87
Integration of a robust shortest path algorithm with a time dependent vehicle routing model and applications 85
A heuristic manipulation technique for the sequential ordering problem 85
A branch and bound algorithm for the robust shortest path problem with interval data 85
Exact models for the flying sidekick traveling salesman problem 85
Skill-Based Joint Order Batching and Picker Routing Problem 85
The minimum power broadcast problem in wireless networks: a simulated annealing approach 84
Measuring the effectiveness of frequency assignment algorithms 83
Vehicle Routing Problem with Uncertain Costs via a Multiple Ant Colony System 82
Design patterns from biology for distributed computing 82
Permutation codes: a new upper bound for M (7, 5) 82
An optimization model for a large-scale energy management problem 82
Machine learning and monte carlo sampling for the probabilistic orienteering problem 82
Heuristic manipulation, tabu search and frequency assignment 81
Totale 11.404
Salva come PNG Salva come JPEG
Categoria #
all - tutte 86.158
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 86.158
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.624 0 0 111 300 333 514 398 307 249 145 187 80
2020/20213.228 336 79 94 182 274 602 169 315 349 448 247 133
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/2025586 412 136 38 0 0 0 0 0 0 0 0 0
Totale 16.266