FISCHETTI, MATTEO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 8.302
EU - Europa 1.335
AS - Asia 1.089
SA - Sud America 37
OC - Oceania 10
AF - Africa 8
Continente sconosciuto - Info sul continente non disponibili 4
Totale 10.785
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 8.264
CN - Cina 342
SG - Singapore 334
VN - Vietnam 301
DE - Germania 232
SE - Svezia 211
FI - Finlandia 200
IT - Italia 174
FR - Francia 139
UA - Ucraina 122
GB - Regno Unito 76
IE - Irlanda 40
CA - Canada 32
BR - Brasile 28
ES - Italia 26
RU - Federazione Russa 25
NL - Olanda 24
IN - India 23
TR - Turchia 19
KR - Corea 16
GR - Grecia 14
MY - Malesia 14
HK - Hong Kong 12
PT - Portogallo 11
AU - Australia 9
IR - Iran 9
JP - Giappone 8
NO - Norvegia 7
RS - Serbia 7
BG - Bulgaria 6
RO - Romania 6
CL - Cile 5
MX - Messico 5
BE - Belgio 4
EU - Europa 4
ID - Indonesia 4
TH - Thailandia 4
CO - Colombia 3
DZ - Algeria 3
PL - Polonia 3
ZA - Sudafrica 3
AT - Austria 2
CH - Svizzera 2
DK - Danimarca 2
AR - Argentina 1
BZ - Belize 1
CY - Cipro 1
CZ - Repubblica Ceca 1
EG - Egitto 1
KG - Kirghizistan 1
NZ - Nuova Zelanda 1
SI - Slovenia 1
TW - Taiwan 1
ZW - Zimbabwe 1
Totale 10.785
Salva come PNG Salva come JPEG
Città #
Fairfield 1.512
Woodbridge 884
Houston 723
Ashburn 601
Seattle 589
Jacksonville 583
Wilmington 557
Cambridge 510
Ann Arbor 468
Santa Clara 315
Dong Ket 301
Singapore 251
Princeton 246
Boardman 194
Chandler 154
San Diego 153
Medford 118
Nanjing 80
Helsinki 76
Padova 59
Des Moines 52
Beijing 46
Guangzhou 43
Dublin 40
Roxbury 35
Columbus 29
Hebei 27
Ogden 24
Jiaxing 20
Changsha 18
Norwalk 18
Shenyang 18
Rome 17
Nanchang 16
Barcelona 15
Frankfurt am Main 12
London 12
Nuremberg 11
Pune 11
Tianjin 11
Kharkiv 10
Seoul 10
Kuching 9
Los Angeles 9
Munich 9
Bologna 8
New York 8
North York 8
Augsburg 7
Belgrade 7
Dresden 7
Philadelphia 7
Rio de Janeiro 7
Bursa 6
Oslo 6
Waterloo 6
Almere Stad 5
Amsterdam 5
Borås 5
Cologne 5
Deakin 5
Hong Kong 5
Istanbul 5
Kilburn 5
Louisville 5
Sofia 5
Tehran 5
Wuppertal 5
Abano Terme 4
Berlin 4
Bilbao 4
Delhi 4
Groningen 4
Heidelberg 4
Hounslow 4
Köln 4
Lancaster 4
Montreal 4
Redwood City 4
Rockville 4
Toulouse 4
Ankara 3
Bandar Puncak Alam 3
Barletta 3
Bogotá 3
Brescia 3
Cape Town 3
Cardiff 3
Chiswick 3
Gainesville 3
Genova 3
Gorizia 3
Juiz de Fora 3
Milan 3
Montijo 3
Montréal 3
Mumbai 3
Phoenix 3
Siena 3
Surabaya 3
Totale 9.142
Salva come PNG Salva come JPEG
Nome #
Matheuristics 303
0, 1/2-Chvatal-Gomory cuts 270
A new ILP-based refinement heuristic for Vehicle Routing Problems 144
On handling indicator constraints in mixed integer programming 134
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs 134
A dynamic reformulation heuristic for Generalized Interdiction Problems 121
A relax-and-cut framework for Gomory's mixed integer cuts 119
Solving Real-World ATSP Instances by Branch-and-Cut 115
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem 108
A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts 106
A Feasibility Pump Heuristic for General Mixed-Integer Problems 101
SelfSplit parallelization for mixed-integer linear programming 101
The Linear Ordering Problem with Cumulative Costs 99
On the use of intersection cuts for bilevel optimization 99
Intersection cuts for Bilevel optimization 98
Exact Methods for the Asymmetric Traveling Salesman Problem 97
Three ideas for the Quadratic Assignment Problem 97
On the separation of disjunctive cuts 95
New facets of the STS polytope generated from known facets of the ATS polytope 94
Projected Chvatal-Gomory cuts for Mixed Integer Linear Programs 91
Mixed-integer cuts from cyclic groups 91
An in-out approach to disjunctive optimization 91
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling 91
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling 91
Towards a MIP-cut metascheme 90
A hard integer program made easy by lexicography. 90
Algorithms for Railway Crew Management 89
Exploiting erraticism in search 89
Optimizing over the first Chvatal closure 87
A Heuristic Method for the Set Covering Problem 86
Crew Scheduling for Netherlands Railways: Destination Customer 86
A branch and bound algorithm for the multiple depot vehicle scheduling problem 86
Approximating the split closure 86
Proximity Benders: a decomposition heuristic for stochastic programs 86
Thinning out Steiner trees: a node-based model for uniform edge costs 85
MIPping closures: an instant survey 84
Worst-case analysis of the differencing method for the partition problem 84
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming 84
The Generalized Traveling Salesman and Orienteering Problems 83
How tight is the corner relaxation? 83
A note on the selection of Benders' cuts 83
Can pure cutting plane algorithms work? 81
Reinventing Crew Scheduling at Netherlands Railways 80
A polyhedral approach to an integer multicommodity flow problem 80
Least cost influence propagation in (social) networks 80
Polyhedral Theory for the Asymmetric Traveling Salesman Problem 79
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems 78
A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs 78
On the enumerative nature of Gomory's dual cutting plane method 78
Lexicography and degeneracy: can a pure cutting plane algorithm work? 78
Repairing MIP infeasibility through Local Branching 77
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem 77
An efficient algorithm for the min-sum arborescence problem on complete digraphs 76
Chasing first queens by integer programming 76
Fast Approaches to Robust Railway Timetabling 75
Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem 74
A branch-and-cut algorithm for the symmetric generalized traveling salesman problem 74
A new linear storage, polynomial-time approximation scheme for the subset-sum problem 74
Interdiction games and monotonicity, with application to knapsack problems 74
Scheduling Train Drivers and Guards: the Dutch Noord-Oost Case 72
Exact Algorithms for Minimum Routing Cost Trees 72
Integer Programming and Combinatorial Optimization 72
Mixed-integer programming models for nesting problems 72
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets 72
A hard integer program made easy by lexicography 72
Solving the Cell Suppression Problem on Tabular Data with Linear Constraints 71
Proximity search for 0-1 mixed-integer convex programming 71
Redesigning benders decomposition for large-scale facility location 71
Feasibility Pump 2.0 70
Self-splitting of Workload in Parallel Computation 69
Solving the orienteering problem through branch-and-cut 68
The Feasibility Pump 68
Orbital shrinking: Theory and applications 67
Heuristics in Mixed Integer Programming 66
A polyhedral approach to an integer multi-commodity flow problem 66
A new dominance procedure for combinatorial optimization problems 66
Improving branch-and-cut performance by random sampling 66
Benders decomposition without separability: A computational study for capacitated facility location problems 66
An additive bounding procedure for the asymmetric travelling salesman problem 66
Combinatorial benders' cuts for mixed-integer linear programming 66
Backdoor Branching 65
The fixed job schedule problem with spread-time constraints 65
New lower bounds for the symmetric travelling salesman problem 64
The New Dutch Timetable: The O.R. Revolution 64
Cutting plane versus compact formulations for uncertain (integer) linear programs 64
Heuristic algorithms for the multiple depot vehicle scheduling problem 62
Fast training of Support Vector Machines with Gaussian kernel 62
The fixed-outdegree 1-arborescence polytope 61
Mixed-integer linear programming heuristics for the prepack optimization problem 61
Deep neural networks and mixed integer linear optimization 61
Array Designer: automated optimized array design for functional near-infrared spectroscopy 61
Optimisation of the Interconnecting Network of a UMTS Radio Mobile Telephone System 60
Facets of the asymmetric traveling salesman polytope 60
Clique tree inequalities define facets of the asymmetric traveling salesman polytope 60
The fixed job schedule problem with working-time constraints 60
Frequency Assignment in Mobile Radio Systems Using Branch-and-Cut Techniques 59
Branch-and-cut algorithms 59
Approximation algorithms for fixed job schedule problems 59
A Local Branching Heuristic for Mixed-Integer Programs with 2-Level Variables 58
Weighted k‐cardinality trees: Complexity and polyhedral structure 58
Totale 8.412
Salva come PNG Salva come JPEG
Categoria #
all - tutte 38.801
article - articoli 30.559
book - libri 0
conference - conferenze 0
curatela - curatele 172
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 4.189
Totale 73.721
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.243 0 0 0 0 0 0 231 279 293 213 99 128
2020/20211.819 80 140 53 112 86 106 31 167 233 116 349 346
2021/20221.864 66 157 207 146 233 77 77 215 164 26 162 334
2022/2023675 309 7 5 38 101 89 2 33 46 9 25 11
2023/2024774 47 56 99 64 55 40 56 37 64 29 112 115
2024/20251.016 10 157 154 70 565 58 2 0 0 0 0 0
Totale 10.873