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

MAFFIOLI, FRANCESCO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.778
EU - Europa 1.226
AS - Asia 186
AF - Africa 8
Continente sconosciuto - Info sul continente non disponibili 4
SA - Sud America 4
OC - Oceania 1
Totale 4.207
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.699
UA - Ucraina 277
SE - Svezia 188
IT - Italia 154
DE - Germania 138
AT - Austria 115
VN - Vietnam 96
FI - Finlandia 83
CA - Canada 79
GB - Regno Unito 72
ES - Italia 70
IE - Irlanda 63
CN - Cina 58
NL - Olanda 28
GR - Grecia 18
FR - Francia 10
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
HK - Hong Kong 2
IR - Iran 2
MY - Malesia 2
AU - Australia 1
CH - Svizzera 1
CO - Colombia 1
HR - Croazia 1
MU - Mauritius 1
PE - Perù 1
TR - Turchia 1
Totale 4.207
Salva come PNG Salva come JPEG
Città #
Fairfield 491
Woodbridge 278
Wilmington 203
Houston 190
Chandler 180
Ashburn 179
Seattle 165
Jacksonville 162
Cambridge 138
Ann Arbor 131
Vienna 115
Dearborn 108
Málaga 70
Lawrence 68
Medford 68
Dublin 63
Ottawa 63
Dong Ket 55
Beijing 32
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
Boardman 4
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
Salerno 2
San Severino Marche 2
Santa Clara 2
Stockholm 2
Turin 2
Bologna 1
Borgosesia 1
Brisbane 1
Cava De' Tirreni 1
Cento 1
Central 1
Central District 1
Chelyabinsk 1
College Park 1
Dallas 1
Erlenbach 1
Fiorano Modenese 1
Florence 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
Mogliano Veneto 1
Montreuil 1
Moscow 1
Nanchang 1
New Bedfont 1
Nizhniy Novgorod 1
Nürnberg 1
Omsk 1
Padova 1
Pasian Di Prato 1
Rotterdam 1
Shanghai 1
Shenzhen 1
Totale 3.055
Salva come PNG Salva come JPEG
Nome #
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints 135
Algorithms for finding minimum fundamental cycle bases in graphs 113
Cardinality constrained minimum cut problems: complexity and algorithms 105
Workforce Management based on forecasted demand 100
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance 96
A branch-and-cut method for the obnoxious p-median problem 95
Erasmus thematic networks and the European dimension of engineering education 88
Computational Experience with a SDP-Based Algorithm for Maximum Cut with Limited Unbalance 88
Approximating Maximum Cut with Limited Unbalance 87
The vehicle routing problem: A book review 87
Innovation, quality and networking in Engineering Education in Europe: the contribution of SOCRATES Thematic Networks 83
Solving minimum k-cardinality cut problems in planar graphs 79
A particular class of graphic matroids 78
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases 78
Edge-swapping algorithms for the minimum fundamental cycle basis problem 78
Efficient algorithms for the assignment of OVSF codes in wideband CDMA 77
The vehicle routing problem: A book review 77
On Minimum Reload Cost Cycle Cover 74
On Minimum Reload Cost Paths, Tours and Flows 72
On the complexity of graph tree partition problems 72
Coloured Ant System and Local Search to Design Local Telecommunication Networks 71
Discrete Facility Location and Routing of Obnoxious Activities 71
Coloured ant system and local search to design local telecommunication networks 69
Elementi di Programmazione Matematica 2^ edizione 68
On minimum reload cost paths, tours, and flows 68
Approximation algorithms for maximum cut with limited unbalance 67
Approximability of hard combiantorial optimization problems: an introduction 66
On some properties of base-matroids 66
The base-matroid and inverse combinatorial optimization problems 66
Fishman's sampling plan for computing network reliability 66
Solving the Feedback Vertex Set Problem on Undirected Graphs 65
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases 64
Minimum cut bases in undirected networks 64
Tuning engineering education into the European higher education orchestra 63
On some properties of base-matroids 63
Erasmus thematic networks and the European dimension of engineering education 61
Thematic Network E4: an effective tool to improve EE in Europe 61
Combinatorial Optimization-Polyhedra and Efficiency or All You Wanted to Know about Polyhedral Combinatorics and Never Dared to Ask 60
Least and most colored bases 59
On binary matroids not isomorphic to their base matroids 59
The minimum fundamental cycle basis problem: a new heuristic based on edge swaps 58
Improved algorithms for orthogonal code assignment in W-CDMA 56
Approximating max cut with limited unbalence 56
Exact Solution of the SONET Ring Loading Problem 56
Combining Linear and Non-Linear Objectives in Spanning Tree Problems 55
The Thematic Network E4: Enhancing Engineering Education in Europe 55
Extensions of matroids to uniform matroids 54
On the Approximability of Some Maximum Spanning Tree Problems 51
SOCRATES Thematic Networks: contributions to mutual knowledge and recognition of engineering education in Europe 49
Third ALIO-EURO meeting on Applied Combinatorial Optimization-Discrete Applied Mathematics 49
Tuning engineering education into the European higher education orchestra 49
A Branch-and-Price Approach to the k-Clustering Minimum Biclique Completion Problem 49
A characterization of the base-matroids of a graphic matroid 47
New Bounds for Optimum Traffic Assignment in Satellite Communication 45
A Lagrangian Heuristic for the Prize Collecting TSP 42
A Mixed-integer Model for Solving Ordering problems with Side Constraints 39
The Contribution of Socrates Thematic Networks to Mutual Recognition of Engineering Study Programs across Europe 39
Il contributo delle Reti Tematiche SOCRATES al mutuo riconoscimento e accreditamento Europeo dei titoli di studio in ingegneria 38
Randomized algorithms over finite fields for the exact parity base problems 38
Re-engineering Engineering Education in Europe 35
Discrete Applied Mathematics - 3rd Cologne/Twente Workshop on Graphs and Combinatorial Optimization (special issue) 34
Eugene Academic Network Contributing to the Realisation of the European Higher Education Area 34
Two-Connected Networks with Bounded Meshes 33
Solution of the Cumulative Assignment Problem with a well-structured Tabu Search Method 30
A Tree Partitioning Dynamic Policy for OVSF Codes Assignment in CDMA 28
ECCE - Engineering Observatory on Competence Based Curricula for Job Enhancement 27
Discrete Optimization - Special issue on Graphs and Combinatorial Optimization 26
On Minimum (Fundamental) Cut Bases Of A Graph 13
Totale 4.244
Salva come PNG Salva come JPEG
Categoria #
all - tutte 10.653
article - articoli 6.289
book - libri 137
conference - conferenze 3.311
curatela - curatele 316
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 600
Totale 21.306
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019326 0 0 0 0 0 0 0 0 0 0 161 165
2019/20201.194 68 98 25 80 148 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/2024205 24 61 29 29 6 26 11 11 0 7 1 0
Totale 4.244