Catalogo dei prodotti della ricerca

FURINI, FABIO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 481
EU - Europa 235
AS - Asia 122
SA - Sud America 3
AF - Africa 1
Totale 842
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 465
IT - Italia 126
IN - India 56
SG - Singapore 49
SE - Svezia 24
IE - Irlanda 20
DE - Germania 19
CA - Canada 16
GB - Regno Unito 16
UA - Ucraina 8
HK - Hong Kong 7
CN - Cina 5
FR - Francia 5
RO - Romania 5
FI - Finlandia 4
BR - Brasile 3
CH - Svizzera 2
ES - Italia 2
ID - Indonesia 2
IQ - Iraq 2
PL - Polonia 2
DK - Danimarca 1
KZ - Kazakistan 1
LV - Lettonia 1
ZA - Sudafrica 1
Totale 842
Salva come PNG Salva come JPEG
Città #
Ashburn 56
Fairfield 56
Millbury 44
New York 41
Princeton 40
San Paolo di Civitate 40
Woodbridge 31
Wilmington 29
Singapore 26
Houston 25
Lawrence 20
Dublin 18
Buffalo 17
Andover 15
Rome 14
San Diego 14
Stockholm 13
Norwalk 9
Cambridge 8
Montréal 8
Toronto 8
Central 7
Imola 7
Manchester 7
Milan 7
Bühl 6
Modena 6
Seattle 6
Perugia 5
San Mateo 5
Turin 5
Bologna 4
Bonn 4
Helsinki 4
Mcallen 4
Ann Arbor 3
Guangzhou 3
Alexandria 2
Arceto 2
Aubusson 2
Bergeggi 2
Clifton 2
Des Moines 2
Florence 2
London 2
Madrid 2
Mannheim 2
Monterotondo 2
Sao Jose do Rio Preto 2
Sulaymaniyah 2
Vitry-sur-Seine 2
Wandsworth 2
Warsaw 2
Avellino 1
Barlassina 1
Bern 1
Cariati 1
Council Bluffs 1
Dallas 1
Glasgow 1
Gunzenhausen 1
Ipswich 1
Jakarta 1
Las Vegas 1
Laurel 1
Leawood 1
Muizenberg 1
Nanzdietschweiler 1
Naples 1
New Bedfont 1
Northridge 1
Nuremberg 1
Ostuni 1
Padova 1
Paris 1
Portland 1
Quartu Sant'elena 1
Rimini 1
Ronco Briantino 1
Sacramento 1
Sant'ambrogio Di Torino 1
Southend 1
São Paulo 1
Tappahannock 1
Trento 1
Uzzano 1
Valdaora 1
Velletri 1
Totale 682
Salva come PNG Salva come JPEG
Nome #
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts 44
On the exact separation of cover inequalities of maximum-depth 43
On the Product Knapsack Problem 40
The maximum clique interdiction problem 32
A branch-and-price framework for decomposing graphs into relaxed cliques 30
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem 30
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem 29
A branch-and-cut algorithm for the Edge Interdiction Clique Problem 28
A lexicographic pricer for the fractional bin packing problem 26
Exact approaches for the knapsack problem with setups 25
Tighter MIP models for Barge Container Ship Routing 25
QPLIB: a library of quadratic programming instances 24
Theoretical and computational study of several linearisation techniques for binary quadratic problems 24
Benders decomposition for very large scale partial set covering and maximal covering location problems 23
On integer and bilevel formulations for the k-vertex cut problem 23
Improving the Approximated Projected Perspective Reformulation by dual information 23
A branch-and-price algorithm for the temporal bin packing problem 23
A new branch-and-bound algorithm for the maximum edge-weighted clique problem 22
A note on selective line-graphs and partition colorings 22
Automatic Dantzig–Wolfe reformulation of mixed integer programs 21
The vertex k-cut problem 21
Lower Bounding Techniques for DSATUR-based Branch and Bound 20
Modeling two-dimensional guillotine cutting problems via integer programming 20
A branch-and-price algorithm for the Minimum Sum Coloring Problem 20
Uncommon Dantzig-Wolfe reformulation for the temporal knapsack problem 19
Generation of antipodal random vectors with prescribed non-stationary 2-nd order statistics 19
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation 19
Approximated perspective relaxations: a project and lift approach 17
An exact algorithm for the Partition Coloring Problem 17
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size 17
The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace 17
Heuristic and exact algorithms for the interval min-max regret knapsack problem 17
Solving vertex coloring problems as maximum weight stable set problems 16
Exact weighted vertex coloring via branch-and-price 16
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem 16
ILP Models and Column Generation for the Minimum Sum Coloring Problem 15
Approaches to a real-world Train Timetabling Problem in a railway node 15
Improved rolling horizon approaches to the aircraft sequencing problem 15
A fast heuristic approach for train timetabling in a railway node 14
Models for the two-dimensional two-stage cutting stock problem with multiple stock size 14
CliSAT: A new exact algorithm for hard maximum clique problems 13
A combinatorial flow-based formulation for temporal bin packing problems 13
A Numerically Exact Algorithm for the Bin-Packing Problem 11
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems 10
State space reduced dynamic programming for the aircraft sequencing problem with constrained position shifting 8
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem 7
A new branch-and-filter exact algorithm for binary constraint satisfaction problems 7
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups 4
Totale 974
Salva come PNG Salva come JPEG
Categoria #
all - tutte 5.886
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 5.886
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022468 0 0 53 51 52 15 4 50 115 2 53 73
2022/2023240 94 62 1 2 8 5 3 2 39 5 10 9
2023/2024250 12 7 18 53 11 43 11 17 3 26 12 37
2024/202516 16 0 0 0 0 0 0 0 0 0 0 0
Totale 974