SALVAGNIN, DOMENICO
 Distribuzione geografica
Continente #
NA - Nord America 2.352
EU - Europa 325
AS - Asia 165
OC - Oceania 5
Continente sconosciuto - Info sul continente non disponibili 3
SA - Sud America 1
Totale 2.851
Nazione #
US - Stati Uniti d'America 2.350
CN - Cina 78
SE - Svezia 74
IT - Italia 72
DE - Germania 55
FI - Finlandia 54
SG - Singapore 45
VN - Vietnam 33
GB - Regno Unito 29
UA - Ucraina 21
IE - Irlanda 12
AU - Australia 5
ID - Indonesia 4
IN - India 4
EU - Europa 3
BG - Bulgaria 2
CA - Canada 2
FR - Francia 2
GR - Grecia 2
RO - Romania 2
BR - Brasile 1
HK - Hong Kong 1
Totale 2.851
Città #
Fairfield 413
Woodbridge 367
Houston 217
Ann Arbor 169
Ashburn 166
Seattle 157
Wilmington 151
Cambridge 128
Jacksonville 99
Chandler 86
San Diego 59
Princeton 53
Medford 38
Dong Ket 33
Des Moines 31
Singapore 26
Helsinki 23
Padova 21
Boardman 20
Nanjing 18
Dublin 12
Roxbury 10
Milan 9
London 8
Beijing 7
Guangzhou 7
Tianjin 7
Cagliari 6
Phoenix 6
Adelaide 5
Changsha 5
Falls Church 5
Jiaxing 5
Karlsruhe 5
Shenyang 5
Zhengzhou 5
Bogor 4
Hebei 4
Nanchang 4
New York 4
Ogden 4
Pune 4
Gorizia 3
Kilburn 3
Leawood 3
Munich 3
Ningbo 3
Norwalk 3
Orange 3
Rohr 3
Santa Caterina 3
Taizhou 3
Borås 2
Brendola 2
Chatham 2
Dieburg 2
Hounslow 2
Kharkiv 2
Merate 2
New Bedfont 2
Nuremberg 2
Perugia 2
Redmond 2
Sofia 2
Timisoara 2
Venice 2
Andover 1
Arezzo 1
Arzignano 1
Bari 1
Bochum 1
Bologna 1
Bussero 1
Chiampo 1
Fremont 1
Geislingen an der Steige 1
Greenwich 1
Haikou 1
Hangzhou 1
Islington 1
Jinan 1
Kyiv 1
Lanzhou 1
Lappeenranta 1
Latina 1
Ludwigshafen 1
Marseille 1
Morgano 1
Naples 1
Regensburg 1
Rochester 1
Rockville 1
Rodgau 1
Torino 1
Vanderhoof 1
Vazzola 1
Vicenza 1
Voghera 1
Wandsworth 1
Werl 1
Totale 2.498
Nome #
On handling indicator constraints in mixed integer programming 128
A relax-and-cut framework for Gomory's mixed integer cuts 112
On solving a hard quadratic 3-dimensional assignment problem 96
A Hybrid MIP/CP Approach for Multi-activity Shift Scheduling 92
A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts 91
SelfSplit parallelization for mixed-integer linear programming 91
Constraint Programming Techniques for Mixed Integer Linear Programs 91
Winner determination in voting trees with incomplete preferences and weighted votes 89
Three ideas for the Quadratic Assignment Problem 88
Exact and heuristic approaches for directional sensor control 87
The strength of multi-row models 84
Improving the Randomization Step in Feasibility Pump 83
Thinning out Steiner trees: a node-based model for uniform edge costs 81
An in-out approach to disjunctive optimization 78
Approximating the split closure 75
Branching on multi-aggregated variables 74
A note on the selection of Benders' cuts 71
Detecting semantic groups in MIP models 68
Fast Approaches to Robust Railway Timetabling 67
Self-splitting of Workload in Parallel Computation 64
Feasibility Pump 2.0 63
Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods 63
Improving branch-and-cut performance by random sampling 61
Finding the next solution in constraint- and preference-based knowledge representation formalisms 60
Detecting and Exploiting Permutation Structures in MIPs 60
Ten years of feasibility pump, and counting 59
Orbital shrinking: Theory and applications 58
Chasing first queens by integer programming 58
MIPLIB 2010 - Mixed Integer Programming Library version 5 57
Mixed-integer linear programming heuristics for the prepack optimization problem 54
Array Designer: automated optimized array design for functional near-infrared spectroscopy 54
Implementing Automatic Benders Decomposition in a Modern MIP Solver 51
Symmetry Breaking Inequalities from the Schreier-Sims Table 49
Cloud Branching 48
Fast approaches to impove the robustness of a railway timetable 47
Minimal Infeasible Subsystems and Benders cuts 45
Pruning moves 43
Some Experiments with Submodular Function Maximization via Integer Programming 43
An exploratory computational analysis of dual degeneracy in mixed-integer programming 34
Just MIP it! 33
Faster SGD training by minibatch persistency 31
The next best solution 30
Tree Search Stabilization by Random Sampling 22
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library 19
Incorporating Sparse and Quantized Carbohydrates Suggestions in Model Predictive Control for Artificial Pancreas in Type 1 Diabete 17
Lagrangian Decomposition for Optimal Cost Partitioning 11
Transferring Information Across Restarts in MIP 8
Using multiple reference vectors and objective scaling in the Feasibility Pump 7
A strategy based on integer programming for optimal dosing and timing of preventive hypoglycemic treatments in type 1 diabetes management 1
Totale 2.896
Categoria #
all - tutte 11.810
article - articoli 6.572
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 934
Totale 19.316


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020494 0 19 9 56 67 45 53 62 74 42 43 24
2020/2021487 29 28 50 26 13 22 10 50 84 40 72 63
2021/2022629 12 63 89 69 72 18 14 89 27 5 60 111
2022/2023303 82 4 3 20 61 40 5 20 32 5 19 12
2023/2024176 8 17 22 19 5 10 14 7 10 7 15 42
2024/20256 6 0 0 0 0 0 0 0 0 0 0 0
Totale 2.896