FISCHETTI, MATTEO
 Distribuzione geografica
Continente #
NA - Nord America 7377
EU - Europa 917
AS - Asia 575
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 4
SA - Sud America 4
AF - Africa 1
Totale 8886
Nazione #
US - Stati Uniti d'America 7360
VN - Vietnam 301
CN - Cina 267
SE - Svezia 207
FI - Finlandia 197
DE - Germania 171
UA - Ucraina 122
IT - Italia 92
IE - Irlanda 38
GB - Regno Unito 26
FR - Francia 25
CA - Canada 16
GR - Grecia 14
AU - Australia 7
RO - Romania 6
BG - Bulgaria 5
EU - Europa 4
RU - Federazione Russa 4
BR - Brasile 3
NL - Olanda 3
AT - Austria 2
BE - Belgio 2
IN - India 2
JP - Giappone 2
TR - Turchia 2
BZ - Belize 1
CH - Svizzera 1
CL - Cile 1
CZ - Repubblica Ceca 1
IR - Iran 1
NZ - Nuova Zelanda 1
SI - Slovenia 1
ZW - Zimbabwe 1
Totale 8886
Città #
Fairfield 1515
Woodbridge 884
Houston 723
Seattle 587
Jacksonville 583
Ashburn 579
Wilmington 557
Cambridge 508
Ann Arbor 468
Dong Ket 301
Princeton 247
San Diego 153
Chandler 137
Medford 119
Nanjing 80
Helsinki 75
Des Moines 53
Padova 47
Guangzhou 42
Dublin 38
Roxbury 36
Hebei 27
Boardman 24
Beijing 23
Jiaxing 20
Norwalk 18
Shenyang 18
Changsha 17
Nanchang 16
Tianjin 11
Kharkiv 10
North York 8
Philadelphia 7
Borås 5
Deakin 5
Sofia 5
Wuppertal 5
Köln 4
Munich 4
Redwood City 4
Rockville 4
Brescia 3
Genova 3
Gorizia 3
Milan 3
Montréal 3
Phoenix 3
Taizhou 3
Timisoara 3
Augsburg 2
Berlin 2
Bologna 2
Buffalo 2
Chongqing 2
Harestad 2
Leawood 2
London 2
Mcallen 2
Modena 2
Rome 2
Tokyo 2
Trieste 2
Usingen 2
Venezia 2
Vicenza 2
Yenibosna 2
Zhengzhou 2
Andover 1
Ardabil 1
Belize City 1
Bolzano 1
Cartagena 1
Castano Primo 1
Chicago 1
Cleveland 1
Frankfurt am Main 1
Fuzhou 1
Groningen 1
Hangzhou 1
Hanover 1
Harare 1
Heinsberg 1
Karlsruhe 1
Latina 1
Mountain View 1
Mumbai 1
Ningbo 1
Nuremberg 1
Orange 1
Pinehaven 1
Redmond 1
Rio De Janeiro 1
Rubano 1
San Francisco 1
San Jose 1
San Vito Al Tagliamento 1
Shanghai 1
Torino 1
Toronto 1
Turin 1
Totale 8060
Nome #
0, 1/2-Chvatal-Gomory cuts 221
On handling indicator constraints in mixed integer programming 125
A new ILP-based refinement heuristic for Vehicle Routing Problems 119
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs 115
A relax-and-cut framework for Gomory's mixed integer cuts 108
Solving Real-World ATSP Instances by Branch-and-Cut 104
A dynamic reformulation heuristic for Generalized Interdiction Problems 100
Intersection cuts for Bilevel optimization 93
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem 91
On the separation of disjunctive cuts 90
On the use of intersection cuts for bilevel optimization 90
Exact Methods for the Asymmetric Traveling Salesman Problem 88
The Linear Ordering Problem with Cumulative Costs 88
SelfSplit parallelization for mixed-integer linear programming 88
A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts 87
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling 85
Mixed-integer cuts from cyclic groups 83
Exploiting erraticism in search 83
A Feasibility Pump Heuristic for General Mixed-Integer Problems 82
New facets of the STS polytope generated from known facets of the ATS polytope 81
Proximity Benders: a decomposition heuristic for stochastic programs 81
Projected Chvatal-Gomory cuts for Mixed Integer Linear Programs 80
Algorithms for Railway Crew Management 79
Three ideas for the Quadratic Assignment Problem 79
Optimizing over the first Chvatal closure 78
MIPping closures: an instant survey 77
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling 77
Thinning out Steiner trees: a node-based model for uniform edge costs 77
Crew Scheduling for Netherlands Railways: Destination Customer 76
How tight is the corner relaxation? 76
Towards a MIP-cut metascheme 76
The Generalized Traveling Salesman and Orienteering Problems 75
A branch and bound algorithm for the multiple depot vehicle scheduling problem 74
Approximating the split closure 73
An in-out approach to disjunctive optimization 72
A polyhedral approach to an integer multicommodity flow problem 72
Lexicography and degeneracy: can a pure cutting plane algorithm work? 72
Least cost influence propagation in (social) networks 72
A Heuristic Method for the Set Covering Problem 71
Reinventing Crew Scheduling at Netherlands Railways 71
Polyhedral Theory for the Asymmetric Traveling Salesman Problem 71
Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem 70
A hard integer program made easy by lexicography. 70
A branch-and-cut algorithm for Mixed-Integer Bilinear Programming 70
Worst-case analysis of the differencing method for the partition problem 68
A new linear storage, polynomial-time approximation scheme for the subset-sum problem 68
Interdiction games and monotonicity, with application to knapsack problems 68
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems 67
A note on the selection of Benders' cuts 67
Repairing MIP infeasibility through Local Branching 66
Mixed-integer programming models for nesting problems 66
Can pure cutting plane algorithms work? 66
An efficient algorithm for the min-sum arborescence problem on complete digraphs 66
Scheduling Train Drivers and Guards: the Dutch Noord-Oost Case 65
Proximity search for 0-1 mixed-integer convex programming 65
On the enumerative nature of Gomory's dual cutting plane method 65
Redesigning benders decomposition for large-scale facility location 65
Exact Algorithms for Minimum Routing Cost Trees 64
The Feasibility Pump 64
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem 63
Solving the Cell Suppression Problem on Tabular Data with Linear Constraints 62
Benders decomposition without separability: A computational study for capacitated facility location problems 61
Fast Approaches to Robust Railway Timetabling 60
Integer Programming and Combinatorial Optimization 60
Self-splitting of Workload in Parallel Computation 60
A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs 59
The fixed job schedule problem with spread-time constraints 59
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets 59
A hard integer program made easy by lexicography 59
A branch-and-cut algorithm for the symmetric generalized traveling salesman problem 58
Solving the orienteering problem through branch-and-cut 58
Improving branch-and-cut performance by random sampling 58
Combinatorial benders' cuts for mixed-integer linear programming 58
A polyhedral approach to an integer multi-commodity flow problem 57
Cutting plane versus compact formulations for uncertain (integer) linear programs 57
Heuristics in Mixed Integer Programming 56
New lower bounds for the symmetric travelling salesman problem 56
Orbital shrinking: Theory and applications 56
An additive bounding procedure for the asymmetric travelling salesman problem 56
Feasibility Pump 2.0 55
Backdoor Branching 54
Heuristic algorithms for the multiple depot vehicle scheduling problem 54
Facets of the asymmetric traveling salesman polytope 54
The New Dutch Timetable: The O.R. Revolution 54
Chasing first queens by integer programming 54
Optimisation of the Interconnecting Network of a UMTS Radio Mobile Telephone System 53
The fixed-outdegree 1-arborescence polytope 53
Clique tree inequalities define facets of the asymmetric traveling salesman polytope 53
Mixed-integer linear programming heuristics for the prepack optimization problem 53
Deep neural networks and mixed integer linear optimization 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
The delivery man problem and cumulative matroids 51
Facets of two Steiner arborescence polyhedra 51
Branching on nonchimerical fractionalities 50
Exact and approximate algorithms for the index selection problem in physical database design 49
Frequency Assignment in Mobile Radio Systems Using Branch-and-Cut Techniques 49
A new dominance procedure for combinatorial optimization problems 49
Weighted k‐cardinality trees: Complexity and polyhedral structure 48
Totale 7065
Categoria #
all - tutte 14959
article - articoli 12050
book - libri 0
conference - conferenze 0
curatela - curatele 85
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1468
Totale 28562


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2017/2018137 0000 00 00 1321220
2018/20191334 0516213 35 882 18242430366
2019/20202389 3577836194 267214 231279 29321399128
2020/20211819 8014053112 86106 31167 233116349346
2021/20221871 66157207146 23377 81215 16426162337
2022/2023553 3117538 10189 20 0000
Totale 8968