BOCCIA, MAURIZIO
 Distribuzione geografica
Continente #
NA - Nord America 2.085
AS - Asia 2.075
EU - Europa 1.829
SA - Sud America 265
AF - Africa 38
OC - Oceania 3
Totale 6.295
Nazione #
US - Stati Uniti d'America 1.982
SG - Singapore 1.263
RU - Federazione Russa 863
CN - Cina 470
IT - Italia 426
BR - Brasile 221
HK - Hong Kong 161
UA - Ucraina 129
DE - Germania 96
SE - Svezia 78
VN - Vietnam 75
CA - Canada 70
FI - Finlandia 62
GB - Regno Unito 44
FR - Francia 42
IN - India 29
MX - Messico 22
KR - Corea 20
NL - Olanda 18
PL - Polonia 18
AR - Argentina 17
ZA - Sudafrica 16
IE - Irlanda 14
BD - Bangladesh 10
ES - Italia 9
IQ - Iraq 8
JP - Giappone 8
CL - Cile 7
CO - Colombia 7
LT - Lituania 7
TR - Turchia 7
ET - Etiopia 4
PK - Pakistan 4
BE - Belgio 3
EC - Ecuador 3
HU - Ungheria 3
JM - Giamaica 3
MA - Marocco 3
NO - Norvegia 3
PE - Perù 3
PY - Paraguay 3
VE - Venezuela 3
AE - Emirati Arabi Uniti 2
AT - Austria 2
AU - Australia 2
BH - Bahrain 2
DZ - Algeria 2
GN - Guinea 2
GR - Grecia 2
IR - Iran 2
KZ - Kazakistan 2
MD - Moldavia 2
NP - Nepal 2
SI - Slovenia 2
TN - Tunisia 2
AL - Albania 1
AM - Armenia 1
AO - Angola 1
AZ - Azerbaigian 1
BB - Barbados 1
BO - Bolivia 1
CD - Congo 1
CG - Congo 1
CI - Costa d'Avorio 1
CR - Costa Rica 1
CU - Cuba 1
DK - Danimarca 1
EE - Estonia 1
EG - Egitto 1
GE - Georgia 1
GP - Guadalupe 1
ID - Indonesia 1
IL - Israele 1
KE - Kenya 1
KG - Kirghizistan 1
KW - Kuwait 1
LB - Libano 1
LC - Santa Lucia 1
LV - Lettonia 1
ML - Mali 1
NG - Nigeria 1
NI - Nicaragua 1
NZ - Nuova Zelanda 1
PA - Panama 1
PR - Porto Rico 1
RS - Serbia 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
TW - Taiwan 1
UZ - Uzbekistan 1
Totale 6.295
Città #
Singapore 606
Chandler 317
Moscow 229
Hong Kong 159
Beijing 151
Ashburn 147
Santa Clara 138
Hefei 118
Jacksonville 117
Naples 94
Millbury 64
Boston 53
Woodbridge 53
Los Angeles 48
Ottawa 40
Nanjing 38
Buffalo 37
Princeton 37
Wilmington 35
Houston 30
Lawrence 30
Napoli 30
Des Moines 28
New York 28
The Dalles 26
Munich 24
Redondo Beach 24
São Paulo 21
Seoul 20
Ann Arbor 19
Rome 19
Ho Chi Minh City 18
Helsinki 16
Washington 16
Arzano 15
Amsterdam 12
Dallas 12
Changsha 11
Denver 11
Dong Ket 11
Nanchang 11
Seattle 11
Hanoi 10
Hebei 10
Montreal 10
Orem 10
Turku 10
Chicago 9
Mexico City 9
Poplar 9
Pune 9
Toronto 9
Brescia 8
Haiphong 8
Kronberg 8
Phoenix 8
Warsaw 8
Atlanta 7
Chennai 7
Jiaxing 7
Johannesburg 7
Tianjin 7
Caltavuturo 6
Fairfield 6
Falkenstein 6
London 6
Milan 6
Rio de Janeiro 6
Tokyo 6
Belo Horizonte 5
Council Bluffs 5
Curitiba 5
Dublin 5
Frankfurt am Main 5
Manchester 5
Mumbai 5
Redwood City 5
Salerno 5
Shenyang 5
Stockholm 5
Torino 5
Biên Hòa 4
Boardman 4
Can Tho 4
Cape Town 4
Crispano 4
Recife 4
Salò 4
San Jose 4
Addis Ababa 3
Ankara 3
Baghdad 3
Boulder 3
Brasília 3
Brooklyn 3
Campoli Del Monte Taburno 3
Caserta 3
Castelraimondo 3
Caxias do Sul 3
Contagem 3
Totale 3.261
Nome #
UN ALGORITMO EURISTICO DI LOT SIZING AND SCHEDULING IN UN FLOW-SHOP CON VINCOLI DI CAPACITÀ: IL CASO DI STUDIO DI UN IMPIANTO DEL SETTORE ALIMENTARE 156
A CACHE LOCATION MODEL FOR VIRTUAL PRIVATE NETWORKS 140
A decomposition approach for a very large scale Optimal Diversity Management Problem 127
A MULTICOMMODITY FLOW MODEL FOR QOS MANAGEMENT ON IP NETWORKS 126
FLOW INTERCEPTING FACILITY LOCATION: MODELS AND APPLICATIONS TO URBAN TRAFFIC MANAGEMENT 123
SOLVING LARGE-SCALE CAPACITATED PLANT LOCATION PROBLEMS BY BRANCH-AND-CUT 122
A production problem solved by a network optimisation approach as a specially structured very large-scale p-median problem 121
An effective heuristic for large-scale Capacitated Plant Location Problems 120
Web Cache Location and Network Design in VPNs 115
A heuristic approach for a container loading problem with non-convex domain 114
WEB CACHE LOCATION AND NETWORK DESIGN IN VPNS 113
MODELS AND METHODS FOR THE OPTIMAL LOCATION OF TRAFFIC SENSORS AND VMSS 112
Fenchel cuts for capacitated p-Median problems 111
Web Cache Location and Network Design in VPNs 110
A CACHE LOCATION MODEL FOR VIRTUAL PRIVATE NETWORKS 106
A column-and-row generation approach for the flying sidekick travelling salesman problem 106
A Cut and Branch Approach for the Capacitated p-Median Problem based on Fenchel Cutting Planes 104
A Heuristic Approach for Wiring Conguration Setting in Car Production 104
A Partitioning Based Heuristic for a Variant of the Simple Pattern Minimality Problem 103
Exact and Heuristic Approaches for Flow Intercepting Facility Location Problems 102
Location sensors and VMS on traffic networks 101
Location of fixed and mobile units for route guidance in traffic management and control 101
A Feature Based Solution Approach for the Flying Sidekick Traveling Salesman Problem 99
Optimal location of VMS's for urban traffic management 97
A Location-Routing Based Solution Approach for Reorganizing Postal Collection Operations in Rural Areas 92
OPS4Math project-Optimization and Problem Solving for Teaching of Mathematics: Teaching strategy, organization and 90
Solving a fuel delivery problem by heuristic and exact approaches 89
A fast heuristic for a three-dimensional non-convex domain loading problem 88
Teaching Mathematics Through Problem Modelling and Solving 87
Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches 87
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm 86
Mathematical models and Tabu Search heuristic for two echelon location routing problems in freight distribution 85
New features for customer classification in the Flying Sidekick Traveling Salesman Problem 83
A Two-Echelon Truck-and-Drone Distribution System: Formulation and Heuristic Approach 83
Exact and heuristic solution approaches for the multi-objective AGV scheduling problem with battery constraints 82
Flow intercepting facility location and routing (FIFLOR) for the design of a city logistic system 81
A new MILP formulation for the flying sidekick traveling salesman problem 78
Location-routing models for designing a two-echelon freight distribution system 78
Integrated operating room planning and scheduling: an ILP-Based off-line approach for emergency responsiveness at a local hospital in Naples 77
Special issue on: Optimization methods for decision making: advancesand applications 76
Exact and heuristic approaches for the Truck–Drone Team Logistics Problem 75
A Branch-and-Cut Algorithm for the Median-Path Problem 74
Swap Minimization in Nearest Neighbour Quantum Circuits: An ILP Formulation 74
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries 72
An Exact Approach for a Variant of the FS-TSP 72
Optimization for Surgery Department Management: An Application to a Hospital in Naples 70
Resource Constrained Shortest Path Problem in Path Planning for Fleet Management 70
An Effective Heuristic for Large-Scale Capacitated Facility Location Problems 69
A MILP formulation for a batch scheduling problem on parallel machines in the aircraft industry 69
Flow intercepting facility location: problems, models and heuristics 68
Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization 67
An optimization-based approach to assess non-interference in labeled and bounded Petri net systems 67
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming 66
Weak flow cover inequalities for the capacitated facility location problem 65
A cutting plane algorithm for capacitated facility location problems 64
Computational experience with general cutting planes for the Set Covering problem 63
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances 62
The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach 60
A metaheuristic for a two echelon location-routing problem 60
A Metaheuristic for a Two Echelon Location-Routing Problem 60
Single-period cutting planes for inventory routing problems 60
A penalty function heuristic for the resource constrained shortest path problem 59
Computational testing of a separation procedure for the knapsack set with a single continuous variable 59
A branch-And-cut algorithm for the multilevel generalized assignment problem 59
Valid inequalities for time-indexed formulations of the runway scheduling problem 58
Lifted and local reachability cuts for the vehicle routing problem with time windows 58
Practice Summary: Solving the External Candidates Exam Schedule in Norway 57
An aggregation heuristic for large scale p-median problem 56
PROCEDIMENTO PER IL BILANCIAMENTO DI PERCORSI DI ROUTING ATTRAVERSO UNA RETE DATI, RELATIVO SISTEMA DI COMUNICAZIONE E PRODOTTO INFORMATICO 56
Time-indexed formulations for the runway scheduling problem 55
A branch and cut heuristic for a runway scheduling problem 55
Simple pattern minimality problems: Integer linear programming formulations and covering-based heuristic solving approaches 55
A computational study of exact knapsack separation for the generalized assignment problem 53
An implementation of exact knapsack separation 53
An optimization approach for congestion control in network routing with quality of service requirements 50
Near-optimal solutions of large-scale single-machine scheduling problems 49
Polyhedral study of simple plant location problem with order 43
Optimization Models for Cut Sequencing 43
Predictive Cyber Foraging for Visual Cloud Computing in Large-Scale IoT Systems 39
A Classification-based Heuristic Approach for the Flying Sidekick Traveling Salesman Problem 14
A New Formulation for the Traveling Salesman Problem With Drone and Lockers 12
The Covering Tour Problem with Arc Upgrades 11
null 2
Totale 6.478
Categoria #
all - tutte 20.623
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 20.623


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021223 0 0 0 0 0 42 55 14 54 16 29 13
2021/2022461 21 0 5 11 9 27 14 13 21 49 100 191
2022/2023617 91 72 10 89 52 90 5 58 110 7 23 10
2023/2024352 24 61 21 36 37 47 4 23 4 15 61 19
2024/20251.949 114 131 15 23 22 156 189 166 110 155 710 158
2025/20262.133 337 305 385 380 630 96 0 0 0 0 0 0
Totale 6.478