RE.PUBLIC@POLIMI pubblicazioni di ricerca del Politecnico di Milano

MALUCELLI, FEDERICO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.845
EU - Europa 2.503
AS - Asia 519
SA - Sud America 23
AF - Africa 10
OC - Oceania 5
Continente sconosciuto - Info sul continente non disponibili 2
Totale 8.907
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.594
IT - Italia 691
UA - Ucraina 415
SE - Svezia 276
DE - Germania 258
CA - Canada 250
AT - Austria 222
VN - Vietnam 182
FI - Finlandia 174
CN - Cina 149
GB - Regno Unito 133
IE - Irlanda 119
SG - Singapore 84
CH - Svizzera 44
ES - Italia 40
JO - Giordania 38
FR - Francia 33
NL - Olanda 31
BE - Belgio 30
BR - Brasile 16
HK - Hong Kong 16
GR - Grecia 13
IN - India 9
KR - Corea 9
TR - Turchia 9
CI - Costa d'Avorio 6
IR - Iran 6
JP - Giappone 5
TW - Taiwan 5
AU - Australia 4
RU - Federazione Russa 4
CZ - Repubblica Ceca 3
DK - Danimarca 3
EC - Ecuador 3
PE - Perù 3
PK - Pakistan 3
PL - Polonia 3
PT - Portogallo 3
EU - Europa 2
IL - Israele 2
IS - Islanda 2
MU - Mauritius 2
NO - Norvegia 2
BF - Burkina Faso 1
BG - Bulgaria 1
CO - Colombia 1
ID - Indonesia 1
LT - Lituania 1
LU - Lussemburgo 1
MX - Messico 1
NG - Nigeria 1
NZ - Nuova Zelanda 1
RO - Romania 1
TH - Thailandia 1
Totale 8.907
Salva come PNG Salva come JPEG
Città #
Fairfield 930
Woodbridge 644
Wilmington 452
Ashburn 413
Houston 392
Seattle 371
Chandler 363
Ann Arbor 328
Cambridge 280
Jacksonville 244
Ottawa 223
Vienna 217
Dearborn 162
Lawrence 133
Medford 120
Dublin 117
Milan 106
Dong Ket 78
Beijing 60
Rome 58
San Diego 57
Helsinki 47
Des Moines 44
Singapore 41
Bern 39
Amman 38
Amsterdam 25
Málaga 25
Brussels 22
Florence 17
Boardman 16
London 16
Princeton 16
Redwood City 16
Ponzano Veneto 14
Taranto 14
Changsha 13
Mountain View 12
New York 12
Norwalk 12
Verona 11
Providence 10
Tavarnuzze 10
Duncan 9
Los Angeles 9
Montréal 8
Washington 8
Auburn Hills 7
Guangzhou 7
Lappeenranta 7
Nanjing 7
Shanghai 7
Abidjan 6
Alfonsine 6
Barcelona 6
Kunming 6
Central 5
Dallas 5
Ferrara 5
Hefei 5
Hounslow 5
Phoenix 5
Reggio Calabria 5
Sha Tin Wai 5
Shenzhen 5
Tallahassee 5
Udine 5
Ancona 4
Belpasso 4
Berkeley 4
Bresso 4
Folignano 4
Hangzhou 4
Kilburn 4
Lamezia Terme 4
Minneapolis 4
Munich 4
North York 4
Padova 4
Palermo 4
Pisa 4
Portland 4
Reggio Emilia 4
Seongnam 4
Seoul 4
Toronto 4
Urbana 4
Bari 3
Bologna 3
Catania 3
Chicago 3
Chiswick 3
Cologne 3
Deurne 3
Faisalabad 3
Falkenstein 3
Genoa 3
Indiana 3
Jette 3
João Pessoa 3
Totale 6.485
Salva come PNG Salva come JPEG
Nome #
Flexible many-to-few + few-to-many = an almost personalized transit system 219
A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems 136
On the design of leisure devoted cycling networks 124
A new matrix bandwidth reduction algorithm 121
Intuizione e creatività: la forza del gioco 116
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings 115
Algorithms for WLAN coverage planning 114
Constraint programming-based column generation 111
An asymmetric vehicle routing problem arising in the collection and disposal of special waste 110
Designing single origin-destination itineraries for several classes of cycle-tourists 110
Lower bounding procedure for the asymmetric quadratic traveling salesman problem 110
Delay Management in Public Transportation: Service Regularity Issues and Crew Re-scheduling 104
Solving a home health care routing problem through iterated local search: the real case of Ferrara 103
A Linear Algorithm for the Hyper Wiener Index of Chemical Trees 102
Chemical trees enumeration algorithms 99
Direct optimal design of a quasi-regular composite-star core network 97
Designing Two-Layer Optical Networks with Statistical Multiplexing 94
A generalized Gilmore-Lawler procedure for the Quadratic Assignment Problem 94
A simple branching scheme for vertex coloring problems 93
Designing optimal routes for cycle-tourists 93
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation 92
A mathematical programming approach for W-CDMA radio planning with uplink and downlink constraints 91
A new lower bound for the quadratic assignment problem 89
Cycle-tourist network design 89
The quadratic shortest path problem: Complexity, approximability, and solution methods 89
Adaptive memory programming for a class of Demand Responsive Transit Systems 87
Resource Constrained Shortest Paths with a Super Additive Objective Function 84
Constraint Programming-based Column Generation 84
Optimization Models for the Radio Planning of Wireless Mesh Networks 83
Radio planning and optimization of W-CDMA Systems 82
A graph optimization approach to item-based collaborative filtering 82
Solving a Resource Allocation Problem in Wireless Mesh Networks: A Comparison Between a CP-Based and a Classical Column Generation 82
Prime esperienze di creatività in matematica per una scuola primaria 82
The Stack Loading and Unloading Problem 81
A survey on planning semi-flexible transit systems: Methodological issues and a unifying framework 80
Designing Pedibus Lines: a Path Based Approach 80
Scheduling a pick and place packaging line 79
Optimization models and algorithms for downlink UMTS radio planning 79
On the Design of the Next Generation Access Networks 79
Testing optimality for quadratic 0-1 problems 78
Solving nonlinear covering problems arising in WLAN design 78
A Lagrangian relaxation approach for the design of networks with shared protection 77
A revised reformulation-linearization technique for the quadratic assignment problem 77
Optimization Models and Methods for Planning Wireless Mesh Networks 74
Discrete models and algorithms for packet scheduling in smart antennas 74
Designing the Master Schedule for Demand-Adaptive Transit Systems 74
Adaptive memory programming for a class of demand responsive transit systems 74
Delay and disruption management in local public transportation via real-time vehicle and crew re-scheduling: a case study 74
A CP-based column generation approach ti scheduling for wireless mesh networks 73
Exact graph coloring via hybrid approaches 73
Optimizing base station siting in UMTS networks 72
Designing the master schedule for demand -adaptive transit systems 72
Hyperbolic set covering problems with competing ground-set elements 71
Content-Aware Planning Models for Information-Centric Networking 71
On the quadratic shortest path problem 71
SRG-disjoint design with dedicated and shared protection 71
WLAN Coverage Planning: Optimization Models and Alghorithms 69
A parallel/distributed approach to the analysis of complex waveguide circuits 69
Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation 69
Optimization based planning of Pedibus lines: an arc based approach 69
A special VRP arising in the optimization of waste disposal: a real case 69
Routing, scheduling and channel assignment in Wireless Mesh Networks: optimization models and algorithms 69
The Stack Loading and Unloading Problem 68
A mathematical model to allocate network capacity among rail services 68
Multicommodity Network Design with Discrete Node Costs 67
The base-matroid and inverse combinatorial optimization problems 66
Multi-layer MPLS network design: The impact of statistical multiplexing 66
Base Station Configuration and Location Problems in UMTS Networks 65
Demand Adaptive Systems:some proposals on flexible transit 65
Metro Scheduling for Special Events 63
A demand responive feeder bus system 62
UMTS radio planning: optimizing base station configuration 62
Regional Mass Transit Assignment with Resource Constraints 61
Improved models and algorithms for UMTS radio planning 60
null 59
On a 2-dimensional equipartition problem 59
An application of constraint solving for home health care 59
Efficient linear system solution in moment methods using wavelet expansions 58
A Benders decomposition approach for the design of Demand-Adaptive transit Systems 58
Optimizing WLAN radio coverage 58
Meta-Heuristics for a Class of Demand-Responsive Transit Systems 58
On Bandwidth-2 graphs 57
Optimization of packet scheduling in wireless systems with smart antennas: geometric models and algorithms 57
Optimizing base station location and configuration in UMTS networks 57
An application of bicriterion shortest paths to collaborative filtering 55
Design of Multi-Layer Networks with Traffic Grooming and Statistical Multiplexing 54
Discrete models and algorithms for the capacitated location problems arising in UMTS network planning 54
A reformulation scheme and new lowerbounds for the quadratic assignment problem 53
Radio planning and coverage optimization of 3G cellular networks 53
A parallel/distributed approach to the analysis of complex waveguide circuits 52
Planning UMTS Base Station Location: Optimization Models with Power Control and Algorithms 52
A particular vehicle routing problem arising in the collection and disposal of special waste 51
Solving a multicommodity location-allocation problem with non linear costs 50
Third ALIO-EURO meeting on Applied Combinatorial Optimization-Discrete Applied Mathematics 50
Base station configuration and location problems in UMTS networks 49
An Optimized parallel admittance matrix approach using the adjacence-graph recursive-thresholding technique 48
Optimal partitioning of a bipartite graph into non-crossing matchings 47
Empowering optimization skills through an orienteering competition 47
Parallel randomized heuristics for the set covering problem 46
Scheduling and Routing in Wireless Multi-Hop Networks by Column Generation 44
Totale 7.685
Salva come PNG Salva come JPEG
Categoria #
all - tutte 28.961
article - articoli 15.773
book - libri 0
conference - conferenze 11.540
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.648
Totale 57.922
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.392 136 186 49 191 283 287 292 182 267 107 277 135
2020/20211.402 132 54 146 53 172 60 106 142 71 140 85 241
2021/20221.135 65 140 75 55 160 39 65 64 78 75 102 217
2022/20231.085 174 88 25 101 118 139 8 83 156 42 71 80
2023/2024749 54 140 36 57 64 145 36 35 28 35 49 70
2024/202554 54 0 0 0 0 0 0 0 0 0 0 0
Totale 9.029