statistiche ricercatore

Nazione	#
US - Stati Uniti d'America	300
SG - Singapore	151
CN - Cina	103
BR - Brasile	101
IT - Italia	83
VN - Vietnam	71
HK - Hong Kong	46
FR - Francia	25
EE - Estonia	24
DE - Germania	17
KR - Corea	14
AR - Argentina	13
JP - Giappone	10
PL - Polonia	10
EC - Ecuador	8
CA - Canada	7
IN - India	7
TR - Turchia	7
IQ - Iraq	6
AT - Austria	5
BE - Belgio	5
PK - Pakistan	5
ZA - Sudafrica	5
ES - Italia	4
FI - Finlandia	4
GB - Regno Unito	4
MX - Messico	4
NL - Olanda	4
TN - Tunisia	4
CL - Cile	3
EG - Egitto	3
ID - Indonesia	3
KH - Cambogia	3
PE - Perù	3
SA - Arabia Saudita	3
UZ - Uzbekistan	3
AE - Emirati Arabi Uniti	2
BD - Bangladesh	2
CY - Cipro	2
DO - Repubblica Dominicana	2
IL - Israele	2
LT - Lituania	2
PY - Paraguay	2
UA - Ucraina	2
VE - Venezuela	2
AL - Albania	1
BA - Bosnia-Erzegovina	1
BN - Brunei Darussalam	1
BO - Bolivia	1
CI - Costa d'Avorio	1
CO - Colombia	1
CZ - Repubblica Ceca	1
DZ - Algeria	1
HU - Ungheria	1
JM - Giamaica	1
JO - Giordania	1
KE - Kenya	1
KG - Kirghizistan	1
KZ - Kazakistan	1
MA - Marocco	1
PR - Porto Rico	1
PT - Portogallo	1
RO - Romania	1
RU - Federazione Russa	1
SE - Svezia	1
SI - Slovenia	1
SK - Slovacchia (Repubblica Slovacca)	1
SN - Senegal	1
UY - Uruguay	1
Totale	1.110

Nome	#
Start-Up/Shut-Down MINLP Formulations for the Unit Commitment with ramp constraints	120
A Benders decomposition approach for planning home blood donations	93
A New Software System for Optimizing the Operations at a Container Terminal	90
Lagrangian Methods and Dynamic Programming-Based MIP Formulations for the Unit Commitment Problem	80
New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints	75
A Branch and Cut algorithm for the Restricted Block Relocation Problem	73
A heuristic algorithm for the Bin Packing Problem with Conflicts on interval graphs	65
The realization-independent reallocation heuristic for the stochastic container relocation problem	65
On the Benchmark Instances for the Bin Packing Problem with Conflicts	60
A counterexample to an exact extended formulation for the single-unit commitment problem	55
Start-up/Shut-down MINLP Formulations for the Unit Commitment with Ramp Constraints	50
A local search approach for the Bin Packing Problem with Conflicts on Interval Graphs	48
New MI-SOCP formulations for the Unit Commitment problems with ramping constraints	47
DP-based formulations of the Unit Commitment Problem and the Convex Hull of Star-Shaped MINLPs	47
A new lower bound for the Block Relocation Problem	46
Some Complexity Results for the Minimum Blocking Items Problem	45
The Bounded Beam Search algorithm for the Block Relocation Problem	45
On the benchmark instances for the Bin Packing with Conflicts	40
null	22
Totale	1.166

	Totale	Lug	Ago	Sett	Ott	Nov	Dic	Gen	Feb	Mar	Apr	Mag	Giu
2023/2024	8	0	0	0	0	0	0	0	0	1	1	5	1
2024/2025	476	5	1	27	57	114	46	47	36	1	10	75	57
2025/2026	682	32	111	60	78	136	54	90	26	44	35	16	0
Totale													1.166

CNR Institutional Research Information System