CONFORTI, MICHELANGELO
 Distribuzione geografica
Continente #
NA - Nord America 8.910
AS - Asia 2.361
EU - Europa 1.420
AF - Africa 757
SA - Sud America 631
OC - Oceania 68
Continente sconosciuto - Info sul continente non disponibili 42
Totale 14.189
Nazione #
US - Stati Uniti d'America 8.534
SG - Singapore 898
BR - Brasile 390
HK - Hong Kong 359
CN - Cina 248
FI - Finlandia 172
VN - Vietnam 125
SE - Svezia 124
PL - Polonia 99
IT - Italia 96
FR - Francia 70
UA - Ucraina 64
DE - Germania 62
RU - Federazione Russa 62
GB - Regno Unito 60
AR - Argentina 40
IE - Irlanda 35
TR - Turchia 35
LA - Repubblica Popolare Democratica del Laos 33
SA - Arabia Saudita 33
ZA - Sudafrica 33
MX - Messico 32
AL - Albania 31
EC - Ecuador 31
ID - Indonesia 31
BZ - Belize 30
AO - Angola 29
CW - ???statistics.table.value.countryCode.CW??? 29
IL - Israele 29
MD - Moldavia 29
LV - Lettonia 28
LY - Libia 28
IN - India 27
UY - Uruguay 27
UZ - Uzbekistan 27
IQ - Iraq 26
KZ - Kazakistan 26
NL - Olanda 26
CO - Colombia 25
BA - Bosnia-Erzegovina 24
GE - Georgia 24
MZ - Mozambico 24
SK - Slovacchia (Repubblica Slovacca) 24
UG - Uganda 24
AE - Emirati Arabi Uniti 23
CG - Congo 23
DO - Repubblica Dominicana 23
GA - Gabon 23
GT - Guatemala 23
MA - Marocco 23
PE - Perù 23
PH - Filippine 23
PK - Pakistan 23
PS - Palestinian Territory 23
PY - Paraguay 23
ZW - Zimbabwe 23
AT - Austria 22
CM - Camerun 22
GR - Grecia 22
HU - Ungheria 22
JM - Giamaica 22
ZM - Zambia 22
CV - Capo Verde 21
ES - Italia 21
HN - Honduras 21
HR - Croazia 21
JP - Giappone 21
LC - Santa Lucia 21
NP - Nepal 21
PT - Portogallo 21
RO - Romania 21
SI - Slovenia 21
CL - Cile 20
CY - Cipro 20
DZ - Algeria 20
GH - Ghana 20
NE - Niger 20
NI - Nicaragua 20
YE - Yemen 20
AF - Afghanistan, Repubblica islamica di 19
BE - Belgio 19
BY - Bielorussia 19
CD - Congo 19
CR - Costa Rica 19
EE - Estonia 19
GM - Gambi 19
GN - Guinea 19
KH - Cambogia 19
PA - Panama 19
RS - Serbia 19
SO - Somalia 19
TT - Trinidad e Tobago 19
TZ - Tanzania 19
VE - Venezuela 19
AM - Armenia 18
BF - Burkina Faso 18
BG - Bulgaria 18
EG - Egitto 18
GF - Guiana Francese 18
IR - Iran 18
Totale 13.354
Città #
Fairfield 1.539
Woodbridge 1.062
Ann Arbor 761
Houston 735
Ashburn 658
Seattle 561
Cambridge 505
Wilmington 495
Singapore 402
Santa Clara 390
Hong Kong 342
Chandler 253
Jacksonville 205
Princeton 150
Boardman 139
San Diego 132
Medford 81
Bytom 72
Helsinki 62
Des Moines 58
Beijing 48
Nanjing 45
Padova 41
Ho Chi Minh City 39
São Paulo 36
Los Angeles 32
Vientiane 31
Chicago 29
Riga 28
Dublin 27
Tashkent 25
Guangzhou 24
Luanda 24
Hanoi 23
Harare 22
Montevideo 22
Willemstad 22
Chisinau 21
Kampala 21
Libreville 21
Lusaka 21
Praia 20
Castries 19
Conakry 19
Managua 19
Rio de Janeiro 19
Accra 18
Maputo 18
Phnom Penh 18
Roxbury 18
Bamako 17
Dar es Salaam 17
Kinshasa 17
Lima 17
Guatemala City 16
Hefei 16
Niamey 16
Tbilisi 16
Tripoli 16
Vienna 16
Brazzaville 15
Buffalo 15
Cotonou 15
Havana 15
Jiaxing 15
Tallinn 15
Abidjan 14
Baku 14
Banjul 14
Djibouti 14
Podgorica 14
Santo Domingo 14
Shenyang 14
Tirana 14
Yerevan 14
Zagreb 14
Baghdad 13
Bishkek 13
Dakar 13
Douala 13
Hargeisa 13
Johannesburg 13
Kingston 13
Lilongwe 13
Redondo Beach 13
Reykjavik 13
Riyadh 13
San José 13
Sanaa 13
Sofia 13
Ulan Bator 13
Addis Ababa 12
Belize City 12
Bridgetown 12
Dili 12
Dong Ket 12
Kingstown 12
Minsk 12
Nairobi 12
Panama City 12
Totale 10.069
Nome #
Extreme functions with an arbitrary number of slopes 192
A counterexample to a conjecture of Gomory and Johnson 185
Recognizing balanceable matrices 183
The equipartition polytope. II: Valid inequalities and facets 183
Decomposition of balanced matrices 175
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs 174
A branch-and-cut algorithm for the equicut problem 173
A geometric approach to cut-generating functions 171
Disjoint Paths in Arborescences 171
Extended formulations in combinatorial optimization 168
Square-free perfect graphs 166
Structural properties and recognition of restricted and strongly unimodular matrices 165
The Structure of the Infinite Models in Integer Programming 162
Balas formulation for the union of polytopes is optimal 160
The equipartition polytope. I: Formulations, dimension and basic facets 159
The projected faces property and polyhedral relations 157
Extreme functions with an arbitrary number of slopes 156
A characterization of matroidal systems of inequalities 156
Balanced 0, ±1-matrices, bicoloring and total dual integrality 156
Ki-covers I: Complexity and polytopes 155
Balanced 0, ± 1 Matrices II. Recognition Algorithm 154
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations 153
Optimal Cutting Planes from the Group Relaxations 153
Bicolorings and equitable bicolorings of matrices 152
Perfect, ideal and balanced matrices 151
A class of logic problems solvable by linear programming 151
An extreme function which is nonnegative and discontinuous everywhere 151
“Facet” separation with one linear program 151
The structure of the infinite models in integer programming 150
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins 149
Unique lifting of integer variables in minimal inequalities 149
Structural properties and decomposition of linear balanced matrices 148
Perfect 0,+1,-1 matrices 147
A Geometric Perspective on Lifting 144
Maximal S-free convex sets and the Helly number 143
Reconstructing edge-disjoint paths 143
Even and odd holes in cap-free graphs 142
Cut-generating functions 141
Minimal Inequalities For An Infinite Relaxation of Integer Programs 140
Odd cycles and matrices with integrality properties 140
A construction for binary matroids 140
Sequentially rejective pairwise testing procedures 140
Cutting planes from two-term disjunctions 140
Balanced cycles and holes in bipartite graphs 140
Reverse Chvátal-Gomory Rank 139
Compact formulations as a union of polyhedra 137
On the geometric structure of independence systems 136
Edge-connectivity augmentation and network matrices 135
Network Formulations of Mixed-Integer Programs 135
The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows 135
Decomposition of wheel-and-parachute-free balanced bipartite graphs 134
Corner polyhedron and intersection cuts 132
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets 132
A polyhedral approach to an integer multicommodity flow problem 131
Properties of balanced and perfect matrices 130
Subgraph polytopes and independence polytopes of count matroids 129
Odd hole recognition in graphs of bounded clique size 128
Projecting an extended formulation for mixed-integer covers on bipartite graphs 128
Reverse Chvátal-Gomory rank 128
Universally signable graphs 128
Some New Matroids on Graphs: Cut Sets and the Max Cut Problem 128
The mixing set with divisible capacities 127
A mickey-mouse decomposition theorem 126
Extended formulations in combinatorial optimization 125
Maximal Lattice-Free Convex Sets in Linear Subspaces 125
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem 125
Balanced 0, ± 1 Matrices I. Decomposition 125
Decomposing Berge graphs containing no proper wheel, long prism or their complements 124
Equivalence between intersection cuts and the corner polyhedron 123
A theorem of Truemper 123
Shortest paths in conservative graphs 122
Optimality certificates for convex minimization and Helly numbers 122
Polyhedral approaches to mixed integer linear programming 121
Stable sets and graphs with no even holes 120
Testing balancedness and perfection of linear matrices 120
On lifting integer variables in minimal inequalities 119
Perfect graphs, partitionable graphs and cutsets 119
The mixing set with divisible capacities: a simple approach 118
Disjunctive programming and relaxations of polyhedra 117
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II 116
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective 115
Triangle-free graphs that are signable without even holes 114
Balanced matrices 111
Minimally infeasible set-partitioning problems with balanced constraints 111
On the cut polyhedron 110
Mixed-integer vertex covers on bipartite graphs 109
Even hole-free graphs, Part II: Recognition Algorithm 109
Extended formulations in combinatorial optimization 107
Balanced matrices 106
Cut dominants and forbidden minors 106
Perfect 0, +1, -1 matrices 105
The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows 102
Split cuts in the plane 102
Reverse split rank 100
On the convergence of the affine hull of the Chvatal-Gomory closures 99
Minimal inequalities for an infinite relaxation of integer programs 99
Reverse Split Rank 98
Finding an even hole in a graph 98
The mixing set with flows 97
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II 92
Totale 13.531
Categoria #
all - tutte 44.501
article - articoli 35.848
book - libri 255
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1.500
Totale 82.104


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021890 0 0 0 0 58 48 43 207 225 112 127 70
2021/20221.594 68 214 276 65 93 50 104 161 74 43 198 248
2022/2023655 197 13 3 46 148 91 0 39 70 6 35 7
2023/2024312 16 55 40 42 13 11 10 2 10 3 52 58
2024/20251.977 6 163 68 29 471 20 64 155 175 93 329 404
2025/20263.805 103 701 1.315 1.429 257 0 0 0 0 0 0 0
Totale 14.354