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

MAFFIOLI, FRANCESCO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.126
EU - Europa 2.396
AS - Asia 1.777
SA - Sud America 418
AF - Africa 60
Continente sconosciuto - Info sul continente non disponibili 5
OC - Oceania 2
Totale 8.784
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.009
RU - Federazione Russa 935
SG - Singapore 653
CN - Cina 502
BR - Brasile 347
VN - Vietnam 297
UA - Ucraina 282
SE - Svezia 190
IT - Italia 173
DE - Germania 158
AT - Austria 117
FR - Francia 105
GB - Regno Unito 104
CA - Canada 95
FI - Finlandia 93
KR - Corea 92
ES - Italia 73
IE - Irlanda 65
NL - Olanda 58
JP - Giappone 47
IN - India 34
MA - Marocco 32
AR - Argentina 26
HK - Hong Kong 24
GR - Grecia 18
BD - Bangladesh 17
IQ - Iraq 16
EC - Ecuador 13
TR - Turchia 13
ID - Indonesia 11
JO - Giordania 10
PK - Pakistan 10
CO - Colombia 8
PY - Paraguay 8
CI - Costa d'Avorio 7
CL - Cile 6
MX - Messico 6
ZA - Sudafrica 6
AE - Emirati Arabi Uniti 5
IL - Israele 5
PL - Polonia 5
SA - Arabia Saudita 5
EU - Europa 4
JM - Giamaica 4
TW - Taiwan 4
VE - Venezuela 4
AZ - Azerbaigian 3
BE - Belgio 3
CH - Svizzera 3
HN - Honduras 3
KE - Kenya 3
LB - Libano 3
LT - Lituania 3
PE - Perù 3
PH - Filippine 3
TH - Thailandia 3
TN - Tunisia 3
UY - Uruguay 3
UZ - Uzbekistan 3
AL - Albania 2
AM - Armenia 2
AU - Australia 2
BH - Bahrain 2
CZ - Repubblica Ceca 2
DO - Repubblica Dominicana 2
EG - Egitto 2
IR - Iran 2
KG - Kirghizistan 2
LV - Lettonia 2
MU - Mauritius 2
MY - Malesia 2
NP - Nepal 2
SN - Senegal 2
TT - Trinidad e Tobago 2
BB - Barbados 1
BG - Bulgaria 1
CR - Costa Rica 1
CY - Cipro 1
DZ - Algeria 1
GA - Gabon 1
GE - Georgia 1
GT - Guatemala 1
HR - Croazia 1
HU - Ungheria 1
KW - Kuwait 1
LA - Repubblica Popolare Democratica del Laos 1
LY - Libia 1
MD - Moldavia 1
OM - Oman 1
PA - Panama 1
PR - Porto Rico 1
PT - Portogallo 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 8.784
Salva come PNG Salva come JPEG
Città #
Fairfield 491
Ashburn 370
San Jose 286
Woodbridge 278
Santa Clara 247
Singapore 232
Wilmington 203
Houston 195
Chandler 180
Seattle 167
Jacksonville 162
Cambridge 138
Ann Arbor 131
Vienna 116
Moscow 115
Dearborn 108
Hefei 103
Beijing 92
Seoul 81
North Charleston 78
The Dalles 78
Council Bluffs 77
Boardman 72
Málaga 70
Lawrence 68
Medford 68
Dublin 65
Ho Chi Minh City 65
Lauterbourg 64
Ottawa 63
Dong Ket 55
Tokyo 43
Hanoi 41
Los Angeles 40
São Paulo 31
Amsterdam 25
Buffalo 25
Helsinki 25
Des Moines 23
New York 23
Dallas 22
Columbus 20
Las Vegas 20
Hong Kong 19
San Diego 19
Rio de Janeiro 18
Guangzhou 16
Milan 14
Shanghai 14
Casablanca 13
Kenitra 12
London 12
Amman 10
Auburn Hills 9
Haiphong 9
Montréal 9
Verona 9
Norwalk 8
Seongnam 8
Abidjan 7
Belo Horizonte 7
Da Nang 7
Frankfurt am Main 7
Nanjing 7
Orem 7
Rotterdam 7
Shenzhen 7
Ankara 6
Baghdad 6
Düsseldorf 6
Montreal 6
Mountain View 6
North York 6
Asunción 5
Curitiba 5
Denver 5
Guayaquil 5
Hangzhou 5
Johannesburg 5
Juiz de Fora 5
Kent 5
Lahore 5
Pelotas 5
Porto Alegre 5
Redwood City 5
Turin 5
Uberlândia 5
Boston 4
Brooklyn 4
Campinas 4
Chicago 4
Duncan 4
Hortolândia 4
Kunming 4
Mumbai 4
Portsmouth 4
Rome 4
Santo André 4
Stockholm 4
Tianjin 4
Totale 5.269
Salva come PNG Salva come JPEG
Nome #
Algorithms for finding minimum fundamental cycle bases in graphs 255
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints 249
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance 232
A branch-and-cut method for the obnoxious p-median problem 222
Cardinality constrained minimum cut problems: complexity and algorithms 183
Computational Experience with a SDP-Based Algorithm for Maximum Cut with Limited Unbalance 178
Approximating Maximum Cut with Limited Unbalance 174
A Branch-and-Price Approach to the k-Clustering Minimum Biclique Completion Problem 165
A particular class of graphic matroids 164
A Mixed-integer Model for Solving Ordering problems with Side Constraints 163
On Minimum Reload Cost Cycle Cover 163
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases 161
Workforce Management based on forecasted demand 161
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases 157
The vehicle routing problem: A book review 156
Solving minimum k-cardinality cut problems in planar graphs 152
Approximation algorithms for maximum cut with limited unbalance 148
Coloured Ant System and Local Search to Design Local Telecommunication Networks 147
Approximability of hard combiantorial optimization problems: an introduction 143
A Lagrangian Heuristic for the Prize Collecting TSP 141
Coloured ant system and local search to design local telecommunication networks 141
Erasmus thematic networks and the European dimension of engineering education 139
Innovation, quality and networking in Engineering Education in Europe: the contribution of SOCRATES Thematic Networks 138
Efficient algorithms for the assignment of OVSF codes in wideband CDMA 138
The minimum fundamental cycle basis problem: a new heuristic based on edge swaps 136
The vehicle routing problem: A book review 134
Approximating max cut with limited unbalence 133
On the complexity of graph tree partition problems 132
Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask 132
Combining Linear and Non-Linear Objectives in Spanning Tree Problems 131
A characterization of the base-matroids of a graphic matroid 130
Discrete Facility Location and Routing of Obnoxious Activities 126
Extensions of matroids to uniform matroids 126
Elementi di Programmazione Matematica 2^ edizione 126
On minimum reload cost paths, tours, and flows 126
On Minimum Reload Cost Paths, Tours and Flows 125
Tuning engineering education into the European higher education orchestra 122
Edge-swapping algorithms for the minimum fundamental cycle basis problem 121
Minimum cut bases in undirected networks 119
The Thematic Network E4: Enhancing Engineering Education in Europe 118
The base-matroid and inverse combinatorial optimization problems 117
Fishman's sampling plan for computing network reliability 116
On binary matroids not isomorphic to their base matroids 114
Improved algorithms for orthogonal code assignment in W-CDMA 113
On some properties of base-matroids 113
Solving the Feedback Vertex Set Problem on Undirected Graphs 111
Erasmus thematic networks and the European dimension of engineering education 111
On some properties of base-matroids 111
A Tree Partitioning Dynamic Policy for OVSF Codes Assignment in CDMA 111
Third ALIO-EURO meeting on Applied Combinatorial Optimization-Discrete Applied Mathematics 109
Exact Solution of the SONET Ring Loading Problem 109
Thematic Network E4: an effective tool to improve EE in Europe 104
New Bounds for Optimum Traffic Assignment in Satellite Communication 102
SOCRATES Thematic Networks: contributions to mutual knowledge and recognition of engineering education in Europe 99
Least and most colored bases 98
Re-engineering Engineering Education in Europe 96
On the Approximability of Some Maximum Spanning Tree Problems 94
Discrete Applied Mathematics - 3rd Cologne/Twente Workshop on Graphs and Combinatorial Optimization (special issue) 90
Tuning engineering education into the European higher education orchestra 88
Il contributo delle Reti Tematiche SOCRATES al mutuo riconoscimento e accreditamento Europeo dei titoli di studio in ingegneria 87
Two-Connected Networks with Bounded Meshes 87
The Contribution of Socrates Thematic Networks to Mutual Recognition of Engineering Study Programs across Europe 87
Solution of the Cumulative Assignment Problem with a well-structured Tabu Search Method 81
Eugene Academic Network Contributing to the Realisation of the European Higher Education Area 80
ECCE - Engineering Observatory on Competence Based Curricula for Job Enhancement 78
Discrete Optimization - Special issue on Graphs and Combinatorial Optimization 74
Randomized algorithms over finite fields for the exact parity base problems 72
On Minimum (Fundamental) Cut Bases Of A Graph 62
Totale 8.821
Salva come PNG Salva come JPEG
Categoria #
all - tutte 22.431
article - articoli 13.099
book - libri 303
conference - conferenze 6.959
curatela - curatele 797
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.273
Totale 44.862
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021259 0 0 0 0 0 0 0 0 0 85 44 130
2021/2022497 20 51 14 40 93 28 19 21 28 41 37 105
2022/2023476 75 27 25 32 57 56 0 26 67 75 33 3
2023/2024223 24 61 29 29 6 26 11 11 0 7 6 13
2024/20251.216 18 6 16 18 247 90 39 97 143 135 177 230
2025/20263.343 654 705 188 372 151 152 453 204 165 299 0 0
Totale 8.821