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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20191.038 0 0 0 0 0 0 0 0 0 242 430 366
2019/20202.389 357 78 36 194 267 214 231 279 293 213 99 128
2020/20211.819 80 140 53 112 86 106 31 167 233 116 349 346
2021/20221.871 66 157 207 146 233 77 81 215 164 26 162 337
2022/2023677 311 7 5 38 101 89 2 33 46 9 25 11
2023/2024543 47 56 99 64 55 40 56 37 64 25 0 0
Totale 9.635