VENTURA, PAOLO
 Distribuzione geografica
Continente #
NA - Nord America 3.575
EU - Europa 1.961
AS - Asia 1.722
SA - Sud America 294
AF - Africa 34
OC - Oceania 4
Continente sconosciuto - Info sul continente non disponibili 1
Totale 7.591
Nazione #
US - Stati Uniti d'America 3.534
RU - Federazione Russa 1.307
SG - Singapore 633
CN - Cina 521
BR - Brasile 239
DE - Germania 199
IT - Italia 182
VN - Vietnam 145
HK - Hong Kong 140
KR - Corea 107
FR - Francia 88
NL - Olanda 65
JP - Giappone 40
EE - Estonia 28
BD - Bangladesh 27
IN - India 26
AR - Argentina 23
FI - Finlandia 21
GB - Regno Unito 20
IL - Israele 15
CA - Canada 13
IQ - Iraq 13
ES - Italia 12
VE - Venezuela 9
CI - Costa d'Avorio 8
MX - Messico 8
EC - Ecuador 7
PK - Pakistan 7
PL - Polonia 7
TR - Turchia 7
ID - Indonesia 6
SA - Arabia Saudita 6
MA - Marocco 5
UZ - Uzbekistan 5
ZA - Sudafrica 5
AT - Austria 4
AU - Australia 4
BO - Bolivia 4
CO - Colombia 4
HU - Ungheria 4
IR - Iran 4
JM - Giamaica 4
JO - Giordania 4
LT - Lituania 4
UA - Ucraina 4
CR - Costa Rica 3
GR - Grecia 3
HN - Honduras 3
PE - Perù 3
PR - Porto Rico 3
SE - Svezia 3
AZ - Azerbaigian 2
BE - Belgio 2
CZ - Repubblica Ceca 2
ET - Etiopia 2
GH - Ghana 2
IE - Irlanda 2
KE - Kenya 2
KZ - Kazakistan 2
MY - Malesia 2
PT - Portogallo 2
PY - Paraguay 2
TH - Thailandia 2
TT - Trinidad e Tobago 2
AE - Emirati Arabi Uniti 1
AM - Armenia 1
BF - Burkina Faso 1
BZ - Belize 1
CL - Cile 1
CU - Cuba 1
DO - Repubblica Dominicana 1
DZ - Algeria 1
EG - Egitto 1
GE - Georgia 1
KG - Kirghizistan 1
KH - Cambogia 1
ML - Mali 1
MN - Mongolia 1
MR - Mauritania 1
MW - Malawi 1
MZ - Mozambico 1
NG - Nigeria 1
NI - Nicaragua 1
NO - Norvegia 1
PA - Panama 1
PH - Filippine 1
PS - Palestinian Territory 1
RS - Serbia 1
SO - Somalia 1
SR - Suriname 1
TN - Tunisia 1
UY - Uruguay 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 7.591
Città #
Dallas 2.517
Santa Clara 503
Singapore 432
Hefei 242
Frankfurt am Main 170
Hong Kong 127
Seoul 103
Beijing 78
Ashburn 68
San Jose 64
Lauterbourg 59
Rome 54
Los Angeles 50
Ho Chi Minh City 49
Hanoi 32
Tokyo 26
São Paulo 24
Tallinn 24
New York 21
Helsinki 20
Minamishinagawa 12
Orem 11
Bengaluru 10
Düsseldorf 10
Naples 10
Buffalo 9
Milan 9
Brooklyn 8
West Jordan 8
Abidjan 7
Boardman 7
Campinas 7
Haiphong 7
Nuremberg 7
Phoenix 7
Salvador 7
Bologna 6
Council Bluffs 6
Dhaka 6
Perugia 6
Bari 5
Chicago 5
Houston 5
Montreal 5
Rio de Janeiro 5
Buenos Aires 4
Des Moines 4
Genoa 4
Ha Long 4
Lahore 4
New Delhi 4
Quito 4
Santa Ana 4
Santa Luzia 4
Tashkent 4
Tehran 4
Warsaw 4
Amman 3
Amsterdam 3
Basra 3
Betim 3
Biên Hòa 3
Boston 3
Catania 3
Chennai 3
Da Nang 3
Florence 3
Fortaleza 3
Francavilla Fontana 3
Groningen 3
Hampton 3
Istanbul 3
Johannesburg 3
Kingston 3
Manaus 3
Milwaukee 3
Ninh Bình 3
Phủ Lý 3
Richmond 3
San Antonio 3
Seattle 3
Sorocaba 3
Stockholm 3
Thái Bình 3
Turin 3
Valencia 3
Accra 2
Addis Ababa 2
Andalusia 2
Atlanta 2
Baghdad 2
Baku 2
Blumenau 2
Bogotá 2
Brasília 2
Brookfield 2
Brumadinho 2
Bắc Ninh 2
Chapecó 2
Cianorte 2
Totale 5.011
Nome #
0/1 Optimization and 0/1 Primal Separation are Equivalent 2.176
A 0,1 Linear Programming Approach to Deadlock Detection and Management in Railways 2.099
Digital twins for intelligent cities: the case study of Matera 222
Preface: 18th Cologne–Twente Workshop on graphs and combinatorial optimization (CTW 2020) 96
A Benders decomposition approach for planning home blood donations 93
A New Software System for Optimizing the Operations at a Container Terminal 90
Mod-2 cuts generation yields the convex hull of bounded integer feasible sets 79
A Branch and Cut algorithm for the Restricted Block Relocation Problem 78
Optimal Network Design for Municipal Waste Management: Application to the Metropolitan City of Rome 76
Generalized Periodic Vehicle Routing and Maritime Surveillance 75
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect 72
Mod-2 cuts generate the convex hull of bounded feasible integer sets 71
The stable set polytope of claw-free graphs with large stability number 70
Strengthened clique-family inequalities for the stable set polytope 70
A compact linear program for testing optimality of perfect matchings 69
Easy Cases of Deadlock Detection in Train Scheduling 65
The realization-independent reallocation heuristic for the stochastic container relocation problem 65
A heuristic and an exact method for the gate matrix connection cost minimization problem 62
Graphs and Combinatorial Optimization: from Theory to Applications CTW2020 Proceedings Preface 60
Optimal patchings for consecutive ones matrices 57
Single courier single restaurant meal delivery (without routing) 56
The Tick Formulation for deadlock detection and avoidance in railways traffic control 52
Disruption Management in Railway Systems by Safe Place Assignment 52
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect 50
Exact methods for solving the open stack problem 49
Optimal Network Design for Waste Management in Regional Districts: the PIPER Project 49
The Bounded Beam Search algorithm for the Block Relocation Problem 48
New bounds and optimal solutions for VRP 47
A new lower bound for the Block Relocation Problem 47
A MaxSAT approach for solving a new Dynamic Discretization Discovery model for train rescheduling problems 46
Some Complexity Results for the Minimum Blocking Items Problem 45
The stable set polytope of claw-free graphs with stability number greater than three 45
OPTIMAL PATCHINGS FOR CONSECUTIVE ONES MATRICES 44
The stable set polytope of claw-free graphs with stability number greater than 3 44
2-clique-bond of stable set polyhedra 42
The stable set polytope of almost all claw free graphs 41
The stable set polytope of (almost) all claw-free graphs 41
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are G-perfect 39
The stable set polytope of claw-free graphs II: XX-graphs are G-perfect 38
ADONET Algorithmic Discrete Optimization Network 37
Optimum solution of the closest string problem via rank distance 35
One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model 35
Mod-2 cuts generate the convex hull of bounded linear feasible integer sets 33
Gear composition and the Stable Set Polytope 33
The Stable Set Polytope of Quasi-Line Graphs: A Proof of Ben Rebea s Conjecture. Part 2 32
Stable Sets in Claw- Free Graphs: A Journey Through Algorithms and Polytopes 32
ADONET Algorithmic Discrete Optimization Network 32
ADONET Algorithmic Discrete Optimization Network 31
The stable set polytope of {antihat, claw}-free graphs 31
Primal Separation for 0/1 Polytopes 31
Mod-2 cuts generation yields the convex hull of bounded integer feasible sets 30
Towards a linear description of the Stable Set polytope for claw-free 30
Cutting and Scheduling: a broad survey 30
Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets 30
Mod-2 cuts generation yelds the convex hull of bounded integer feasible sets 30
Separazione Primale 0/1 ed Ottimizzazione 0/1 sono equivalenti 30
An improved integer linear pro- gramming formulation for the closest 0-1 string problem 30
ADONET Algorithmic Discrete Optimization Network 30
A compact linear program for testing optimality of perfect matchings 29
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs 29
New facet defining inequalities for the Stable Set Polytope 27
New bounds and optimal solutions for VRP 27
The stable set polytope of quasi-line graphs 26
A compact linear program for testing optimality of perfect matching 26
Primal separation for 0/1 polytopes 26
Heuristic and exact methods for the open stacks problem 25
The stable set polytope of quasi-line graphs 25
Stable set in claw-free graphs: recent achievement and future challenges 24
On a graph transformation for the stable set problem 24
On the stable set polytope of claw-free graphs 24
The Stable Set Polytope of Quasi-Line Graphs: A Proof of Ben Rebea's Conjecture. Part 2 24
The open stack problem 22
A compact linear program for testing optimality of perfect matchings 22
Deliverable D3.1 Research Landscape Report 22
Perfect matching: a compact linear formulation of the active cone 21
Totale 7.645
Categoria #
all - tutte 14.646
article - articoli 7.514
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 459
Totale 22.619


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2023/202422 0 0 0 0 0 0 0 0 1 9 12 0
2024/20251.569 11 4 91 111 445 95 31 57 46 91 302 285
2025/20265.984 180 1.153 1.750 344 319 109 346 89 1.495 99 74 26
2026/202770 70 0 0 0 0 0 0 0 0 0 0 0
Totale 7.645