FURINI, FABIO
 Distribuzione geografica
Continente #
AS - Asia 807
NA - Nord America 676
SA - Sud America 158
EU - Europa 103
AF - Africa 13
Continente sconosciuto - Info sul continente non disponibili 1
Totale 1.758
Nazione #
US - Stati Uniti d'America 657
SG - Singapore 344
CN - Cina 172
BR - Brasile 125
HK - Hong Kong 85
VN - Vietnam 74
KR - Corea 43
FR - Francia 37
IT - Italia 27
BD - Bangladesh 19
IN - India 12
AR - Argentina 11
GB - Regno Unito 10
ID - Indonesia 8
IL - Israele 8
JP - Giappone 8
CA - Canada 6
DE - Germania 6
MX - Messico 6
PH - Filippine 6
UA - Ucraina 6
CL - Cile 5
CO - Colombia 5
IQ - Iraq 5
EC - Ecuador 4
FI - Finlandia 4
ZA - Sudafrica 4
MY - Malesia 3
PK - Pakistan 3
RU - Federazione Russa 3
SA - Arabia Saudita 3
TH - Thailandia 3
TT - Trinidad e Tobago 3
VE - Venezuela 3
AE - Emirati Arabi Uniti 2
AT - Austria 2
DM - Dominica 2
DZ - Algeria 2
LB - Libano 2
NL - Olanda 2
PE - Perù 2
PY - Paraguay 2
AL - Albania 1
AO - Angola 1
CH - Svizzera 1
CR - Costa Rica 1
ES - Italia 1
ET - Etiopia 1
GA - Gabon 1
GR - Grecia 1
JM - Giamaica 1
JO - Giordania 1
KE - Kenya 1
KZ - Kazakistan 1
MA - Marocco 1
MU - Mauritius 1
NO - Norvegia 1
NP - Nepal 1
OM - Oman 1
RS - Serbia 1
SN - Senegal 1
TR - Turchia 1
TW - Taiwan 1
UY - Uruguay 1
UZ - Uzbekistan 1
Totale 1.757
Città #
Santa Clara 357
Singapore 198
Hefei 109
Hong Kong 82
San Jose 74
Ashburn 56
Seoul 43
Lauterbourg 34
Ho Chi Minh City 23
Hanoi 22
Dallas 18
São Paulo 17
Beijing 8
Rio de Janeiro 8
New York 7
Da Nang 6
Minamishinagawa 6
Bengaluru 5
Rome 5
Atlanta 4
Council Bluffs 4
Dhaka 4
Haiphong 4
Helsinki 4
Los Angeles 4
Bangkok 3
Buffalo 3
Concepción 3
Denver 3
Duque de Caxias 3
Hangzhou 3
Johannesburg 3
Marietta 3
Palermo 3
Parma 3
Rochester 3
Salvador 3
Boardman 2
Bogotá 2
Boituva 2
Campinas 2
Campo Grande 2
Can Tho 2
Changsha 2
Charlotte 2
Chennai 2
Civitavecchia 2
Cleveland 2
Des Moines 2
Erlanger 2
Frankfurt am Main 2
Guangzhou 2
Guarujá 2
Guarulhos 2
Hải Dương 2
Indaiatuba 2
Izmail 2
Kafr Mandā 2
Kuala Selangor 2
Maceió 2
Manaus 2
Mansfield 2
Medellín 2
Memphis 2
Montes Claros 2
Montreal 2
Mumbai 2
Ninh Bình 2
Norfolk 2
North Little Rock 2
Philadelphia 2
Port of Spain 2
Portland 2
Quito 2
Riyadh 2
Roseau 2
Seattle 2
Thái Nguyên 2
Tokyo 2
Toronto 2
Vienna 2
Villa Ballester 2
Vũng Tàu 2
Aachen 1
Abu Dhabi 1
Algiers 1
Ankara 1
Argirita 1
Asunción 1
Athens 1
Atibaia 1
Baghdad 1
Balsas 1
Bandung 1
Barbacena 1
Barquisimeto 1
Basra 1
Baton Rouge 1
Bauru 1
Bay Shore 1
Totale 1.247
Nome #
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem 80
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem 67
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem 66
Exact approaches for the knapsack problem with setups 65
The maximum clique interdiction problem 64
Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem 60
Improving the Approximated Projected Perspective Reformulation by dual information 52
A branch-and-price algorithm for the Minimum Sum Coloring Problem 52
State space reduced dynamic programming for the aircraft sequencing problem with constrained position shifting 45
A branch-and-cut algorithm for the Edge Interdiction Clique Problem 44
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts 44
An exact algorithm for the Partition Coloring Problem 43
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size 43
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming 41
On the exact separation of cover inequalities of maximum-depth 41
Tighter MIP models for Barge Container Ship Routing 40
A new branch-and-bound algorithm for the maximum edge-weighted clique problem 39
Solving vertex coloring problems as maximum weight stable set problems 38
Benders decomposition for very large scale partial set covering and maximal covering location problems 38
On integer and bilevel formulations for the k-vertex cut problem 37
A branch-and-price algorithm for the temporal bin packing problem 37
A branch-and-price framework for decomposing graphs into relaxed cliques 37
The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace 35
The vertex k-cut problem 34
Automatic Dantzig-Wolfe reformulation of mixed integer programs 34
Models for the two-dimensional two-stage cutting stock problem with multiple stock size 34
Hybrid SDP bounding procedure 34
Partial convexification of general MIPs by Dantzig-Wolfe reformulation 34
Theoretical and computational study of several linearisation techniques for binary quadratic problems 33
Aircraft sequencing problems via a rolling horizon algorithm 33
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem 33
A note on selective line-graphs and partition colorings 33
On the Product Knapsack Problem 33
Preface: decomposition methods for hard optimization problems 31
MIP formulations for a rich real-world lot-sizing problem with setup carryover 31
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation 31
ILP Models and Column Generation for the Minimum Sum Coloring Problem 31
Approaches to a real-world Train Timetabling Problem in a railway node 30
A fast heuristic approach for train timetabling in a railway node 30
Lower Bounding Techniques for DSATUR-based Branch and Bound 29
Exact weighted vertex coloring via branch-and-price 29
A lexicographic pricer for the fractional bin packing problem 26
Improved rolling horizon approaches to the aircraft sequencing problem 24
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics 20
null 3
Totale 1.758
Categoria #
all - tutte 6.625
article - articoli 5.979
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 646
Totale 13.250


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2023/20242 0 0 0 0 0 0 0 0 1 0 0 1
2024/2025798 0 4 50 22 311 49 2 9 23 9 167 152
2025/2026899 56 96 95 112 111 33 194 47 37 70 36 12
2026/202759 39 20 0 0 0 0 0 0 0 0 0 0
Totale 1.758