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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.965 231 110 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/202594 94 0 0 0 0 0 0 0 0 0 0 0
Totale 15.774