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

MAFFIOLI, FRANCESCO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.102
EU - Europa 1.247
AS - Asia 243
AF - Africa 8
Continente sconosciuto - Info sul continente non disponibili 4
SA - Sud America 4
OC - Oceania 1
Totale 4.609
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.022
UA - Ucraina 277
SE - Svezia 188
IT - Italia 169
DE - Germania 139
AT - Austria 115
VN - Vietnam 96
FI - Finlandia 83
CA - Canada 80
GB - Regno Unito 72
ES - Italia 70
CN - Cina 64
IE - Irlanda 63
SG - Singapore 47
NL - Olanda 28
GR - Grecia 18
FR - Francia 13
IN - India 9
JO - Giordania 8
KR - Corea 8
CI - Costa d'Avorio 7
RU - Federazione Russa 6
EU - Europa 4
BE - Belgio 2
BR - Brasile 2
CZ - Repubblica Ceca 2
HK - Hong Kong 2
IR - Iran 2
MY - Malesia 2
AE - Emirati Arabi Uniti 1
AU - Australia 1
CH - Svizzera 1
CO - Colombia 1
CY - Cipro 1
HR - Croazia 1
KG - Kirghizistan 1
MU - Mauritius 1
PE - Perù 1
PH - Filippine 1
TR - Turchia 1
Totale 4.609
Salva come PNG Salva come JPEG
Città #
Fairfield 491
Woodbridge 278
Santa Clara 244
Wilmington 203
Houston 190
Ashburn 187
Chandler 180
Seattle 165
Jacksonville 162
Cambridge 138
Ann Arbor 131
Vienna 115
Dearborn 108
Boardman 72
Málaga 70
Lawrence 68
Medford 68
Dublin 63
Ottawa 63
Dong Ket 55
Beijing 32
Singapore 31
Amsterdam 23
Des Moines 23
Columbus 20
San Diego 19
Helsinki 15
Milan 13
Auburn Hills 9
Montréal 9
Verona 9
Amman 8
Norwalk 8
Seongnam 8
Abidjan 7
Guangzhou 7
Mountain View 6
North York 6
Redwood City 5
Shanghai 5
Turin 5
Duncan 4
Rome 4
Washington 4
Bitritto 3
Miami 3
Nanjing 3
Portland 3
Berlin 2
Brussels 2
Fiumicino 2
Groningen 2
Hanoi 2
Hefei 2
Kunming 2
Lancaster 2
Los Angeles 2
Monza 2
New York 2
Nova Milanese 2
Prague 2
Salerno 2
San Severino Marche 2
Stockholm 2
Trieste 2
Veneta 2
Bishkek 1
Bologna 1
Borgosesia 1
Brescia 1
Brisbane 1
Cava De' Tirreni 1
Cento 1
Central 1
Central District 1
Chelyabinsk 1
College Park 1
Dallas 1
Dubai 1
Erlenbach 1
Fiorano Modenese 1
Florence 1
Frankfurt am Main 1
Fuzhou 1
Guido 1
Gunzenhausen 1
Hangzhou 1
Hertford 1
Hilversum 1
Indiana 1
Istanbul 1
Izhevsk 1
Juiz De Fora 1
Kilburn 1
Kuala Lumpur 1
Lima 1
Manila 1
Mogliano Veneto 1
Montreuil 1
Moscow 1
Totale 3.413
Salva come PNG Salva come JPEG
Nome #
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints 141
Algorithms for finding minimum fundamental cycle bases in graphs 118
Cardinality constrained minimum cut problems: complexity and algorithms 110
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance 106
Workforce Management based on forecasted demand 106
A branch-and-cut method for the obnoxious p-median problem 103
Computational Experience with a SDP-Based Algorithm for Maximum Cut with Limited Unbalance 97
Erasmus thematic networks and the European dimension of engineering education 94
The vehicle routing problem: A book review 94
Approximating Maximum Cut with Limited Unbalance 93
Innovation, quality and networking in Engineering Education in Europe: the contribution of SOCRATES Thematic Networks 88
Solving minimum k-cardinality cut problems in planar graphs 84
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases 84
Edge-swapping algorithms for the minimum fundamental cycle basis problem 84
Efficient algorithms for the assignment of OVSF codes in wideband CDMA 83
A particular class of graphic matroids 83
The vehicle routing problem: A book review 83
On Minimum Reload Cost Cycle Cover 79
Elementi di Programmazione Matematica 2^ edizione 78
Coloured Ant System and Local Search to Design Local Telecommunication Networks 77
On Minimum Reload Cost Paths, Tours and Flows 76
On the complexity of graph tree partition problems 76
Coloured ant system and local search to design local telecommunication networks 75
Discrete Facility Location and Routing of Obnoxious Activities 75
On minimum reload cost paths, tours, and flows 73
Approximation algorithms for maximum cut with limited unbalance 73
On some properties of base-matroids 72
Approximability of hard combiantorial optimization problems: an introduction 71
The base-matroid and inverse combinatorial optimization problems 71
Fishman's sampling plan for computing network reliability 71
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases 71
Solving the Feedback Vertex Set Problem on Undirected Graphs 70
On some properties of base-matroids 69
Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask 68
Exact Solution of the SONET Ring Loading Problem 68
Minimum cut bases in undirected networks 68
On binary matroids not isomorphic to their base matroids 68
Tuning engineering education into the European higher education orchestra 67
The minimum fundamental cycle basis problem: a new heuristic based on edge swaps 65
Erasmus thematic networks and the European dimension of engineering education 65
Thematic Network E4: an effective tool to improve EE in Europe 65
Least and most colored bases 63
Approximating max cut with limited unbalence 62
Combining Linear and Non-Linear Objectives in Spanning Tree Problems 62
Improved algorithms for orthogonal code assignment in W-CDMA 61
The Thematic Network E4: Enhancing Engineering Education in Europe 61
Extensions of matroids to uniform matroids 60
Third ALIO-EURO meeting on Applied Combinatorial Optimization-Discrete Applied Mathematics 57
On the Approximability of Some Maximum Spanning Tree Problems 56
A Branch-and-Price Approach to the k-Clustering Minimum Biclique Completion Problem 56
SOCRATES Thematic Networks: contributions to mutual knowledge and recognition of engineering education in Europe 53
Tuning engineering education into the European higher education orchestra 53
A characterization of the base-matroids of a graphic matroid 52
New Bounds for Optimum Traffic Assignment in Satellite Communication 51
A Lagrangian Heuristic for the Prize Collecting TSP 50
Il contributo delle Reti Tematiche SOCRATES al mutuo riconoscimento e accreditamento Europeo dei titoli di studio in ingegneria 45
A Mixed-integer Model for Solving Ordering problems with Side Constraints 45
The Contribution of Socrates Thematic Networks to Mutual Recognition of Engineering Study Programs across Europe 45
Randomized algorithms over finite fields for the exact parity base problems 43
Re-engineering Engineering Education in Europe 41
Discrete Applied Mathematics - 3rd Cologne/Twente Workshop on Graphs and Combinatorial Optimization (special issue) 40
Two-Connected Networks with Bounded Meshes 39
Eugene Academic Network Contributing to the Realisation of the European Higher Education Area 39
Solution of the Cumulative Assignment Problem with a well-structured Tabu Search Method 35
A Tree Partitioning Dynamic Policy for OVSF Codes Assignment in CDMA 34
ECCE - Engineering Observatory on Competence Based Curricula for Job Enhancement 32
Discrete Optimization - Special issue on Graphs and Combinatorial Optimization 31
On Minimum (Fundamental) Cut Bases Of A Graph 18
Totale 4.646
Salva come PNG Salva come JPEG
Categoria #
all - tutte 13.522
article - articoli 7.952
book - libri 184
conference - conferenze 4.143
curatela - curatele 459
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 784
Totale 27.044
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020775 0 0 0 0 0 164 154 88 149 41 131 48
2020/2021765 69 27 79 21 71 71 63 70 35 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/2025384 18 6 16 18 247 79 0 0 0 0 0 0
Totale 4.646