CRIS Current Research Information System

LODI, ANDREA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 10.835
EU - Europa 5.156
AS - Asia 3.016
AF - Africa 331
SA - Sud America 29
OC - Oceania 6
Continente sconosciuto - Info sul continente non disponibili 2
Totale 19.375
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 10.789
GB - Regno Unito 1.565
CN - Cina 1.004
SG - Singapore 933
DE - Germania 791
IT - Italia 771
VN - Vietnam 543
UA - Ucraina 446
SE - Svezia 424
IN - India 270
RU - Federazione Russa 236
FR - Francia 235
IE - Irlanda 180
ZA - Sudafrica 128
JO - Giordania 120
EE - Estonia 107
TG - Togo 70
CH - Svizzera 66
BG - Bulgaria 65
FI - Finlandia 53
CA - Canada 45
SC - Seychelles 39
CI - Costa d'Avorio 36
BE - Belgio 32
GR - Grecia 32
JP - Giappone 31
NG - Nigeria 29
TR - Turchia 24
ES - Italia 23
NL - Olanda 20
PL - Polonia 19
HR - Croazia 18
AT - Austria 16
BR - Brasile 15
ID - Indonesia 15
RS - Serbia 15
HK - Hong Kong 13
SI - Slovenia 12
EG - Egitto 9
MA - Marocco 9
PH - Filippine 9
CZ - Repubblica Ceca 8
IR - Iran 8
LB - Libano 8
SA - Arabia Saudita 8
CL - Cile 7
KR - Corea 6
TN - Tunisia 6
TW - Taiwan 6
AU - Australia 5
HU - Ungheria 4
MY - Malesia 4
RO - Romania 4
DZ - Algeria 3
EC - Ecuador 3
LT - Lituania 3
LU - Lussemburgo 3
QA - Qatar 3
UZ - Uzbekistan 3
A2 - ???statistics.table.value.countryCode.A2??? 2
BD - Bangladesh 2
DK - Danimarca 2
IL - Israele 2
IS - Islanda 2
PE - Perù 2
PT - Portogallo 2
RW - Ruanda 2
AR - Argentina 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
CO - Colombia 1
CR - Costa Rica 1
KZ - Kazakistan 1
LA - Repubblica Popolare Democratica del Laos 1
LV - Lettonia 1
MN - Mongolia 1
NZ - Nuova Zelanda 1
Totale 19.375
Salva come PNG Salva come JPEG
Città #
Ann Arbor 3.904
Southend 1.430
Fairfield 990
Singapore 582
Ashburn 548
Wilmington 527
Santa Clara 471
Woodbridge 457
Seattle 389
Chandler 376
Cambridge 365
Houston 351
Jacksonville 328
Princeton 319
Dong Ket 306
Boardman 252
Dublin 180
Bologna 145
Padova 142
Westminster 137
Nanjing 134
Frankfurt am Main 123
Amman 120
Turin 84
Berlin 81
Saint Petersburg 78
Medford 71
Lomé 70
Jinan 69
Shenyang 69
Sofia 65
Beijing 64
Mülheim 60
Bern 59
New York 53
Helsinki 51
San Diego 50
Hebei 46
Tianjin 44
Nanchang 43
Changsha 42
Milan 41
Mahé 38
Abidjan 36
Guangzhou 34
Abeokuta 29
Brussels 29
Los Angeles 29
Norwalk 27
Tokyo 27
Olalla 24
Des Moines 22
Istanbul 22
Shanghai 22
Zhengzhou 22
Haikou 20
Hangzhou 20
Jiaxing 20
Verona 20
San Venanzo 19
Redmond 18
Montreal 17
Rome 17
Taiyuan 17
Taizhou 16
Cesena 15
Paris 15
Ningbo 14
Fuzhou 13
Lanzhou 13
Jakarta 12
Wuhan 12
Chicago 11
Dearborn 10
Redwood City 10
San Francisco 10
Shijiazhuang 10
London 9
Madrid 9
Montréal 9
Shenzhen 9
Vicenza 9
Bühl 8
Chengdu 8
Kunming 8
Phoenix 8
Qingdao 8
Amsterdam 7
Athens 7
Fort Worth 7
Ithaca 7
Munich 7
Rabat 7
Toronto 7
Falls Church 6
Groningen 6
Kielczow 6
São Paulo 6
Tappahannock 6
Warsaw 6
Totale 14.576
Salva come PNG Salva come JPEG
Nome #
On the Optimal Design of Water Distribution Networks: a Practical MINLP Approach 227
A reconfigurable heterogeneous multiprocessor System on Chip 226
Two-dimensional Bin Packing Problems 225
Water network design by MINLP 214
Nonlinear chance-constrained problems with applications to hydro scheduling 203
Bounding, filtering and diversification in CP-based local branching 200
An optimization problem in the electricity market 194
Mixed integer nonlinear programming tools: a practical overview 182
Mathematical Programming techniques in Water Network Optimization 182
A C-based Programming Enviroment for a heterogeneous reconfigurable system 180
Combinatorial Traveling Salesman Problem Algorithms 175
Piecewise linear approximation of functions of two variables in MILP models 174
A Fast and Efficient Algorithm to Exploit Multi-user Diversity in IEEE 802.16 BandAMC 174
A XiRisc-based SoC for Embedded DSP for Embedded DSP Applications 174
Discrepancy-Based Additive Bounding Procedures 173
Models and Bounds for Two-Dimensional Level Packing Problems 171
An algorithmic framework for convex mixed integer nonlinear programs 171
Scheduling M2M Traffic over LTE Uplink of a dense Small Cells Network 171
Scheduling M2M traffic over LTE uplink of a dense small cell network 170
Design and implementation of a reconfigurable heterogeneous multiprocessor SoC 169
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing 168
An MILP Approach for Short-Term Hydro Scheduling and Unit Commitment With Head-Dependent Reservoir 168
Computing Compatible Tours for the Symmetric Traveling Salesman Problem 166
Experiments with a Feasibility Pump Approach for Non-Convex MINLPs 166
XiSystem: a XiRisc-based SoC with reconfigurable IO module 164
On interval-subgradient and no-good cuts 162
A Feasibility Pump heuristic for general Mixed-Integer Problems 162
Optimal scheduling of a multiunit hydro power station in a short-term planning horizon 160
Baseband analog front-end and digital back-end for reconfigurable multi-standard terminals 159
Heuristics in Mixed Integer Programming 158
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 158
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities 157
Exploiting Relaxations in CP 157
Pre-operative Activities and Operating Theater Planning in Emilia-Romagna, Italy 156
Complexity and approximation of an area packing problem 156
An Approximation Scheme for Two-Stage, Two- Dimensional Knapsack 154
Optimizing the Design of Water Distribution Networks Using Mathematical OptimizationCase Studies in Operations Research 154
XiSystem: a XiRisc-based SoC with Reconfigurable IO module 153
A Feasibility Pump for Mixed Integer Nonlinear Programs 153
A Tale of Two-Dimensional Bin Packing 152
Packing into the smallest square: Worst-case analysis of lower bounds 152
On mathematical programming with indicator constraints 152
CP-based Local Branching 151
An MINLP Solution Method for a Water Network Problem 151
Improving spectral bounds for clustering problems by Lagrangian relaxation 150
Approximation Algorithms for the Multi-Item Capacitated Lot-Sizing Problem via Flow-Cover Inequalities 150
Optimum: Thermal-aware task allocation for heterogeneous many-core devices 150
null 150
Needs forecast and fund allocation of medical specialty positions in Emilia-Romagna (Italy) by system dynamics and integer programming 150
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics 149
Two-Dimensional Bin Packing Problems 149
Exact Algorithms for the Two-Dimensional Guillotine Knapsack 148
Efficient two-dimensional data allocation in IEEE 802.16 OFDMA 148
Low Leakage Design of LUT-based FPGAs 147
Disjunctive Inequalities: Applications and Extensions 147
Emergency Department Management in Lazio, Italy 147
Repairing MIP Infeasibility through Local Branching 145
Implementation of AES/Rijndael on a dynamically reconfigurable architecture 145
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010 144
A Study on the Computational Complexity of the Bilevel Knapsack Problem 144
On the integration of Metaheuristic strategies in Constraint Programming 142
Optimizing over the first Chvatal closure 142
On Bilevel Programming and Its Impact in Branching, Cutting and Complexity 141
MIPping closures: an instant survey 140
Efficient and Fair Routing for Mesh Networks 140
Efficient two-dimensional packing algorithms for mobile WiMAX 139
Single-commodity robust network design with finite and Hose demand sets 139
New Approaches for Optimizing over the Semimetric Polytope 137
Test-Assignment: A Quadratic Coloring Problem 137
Low leakage techniques for FPGAs 137
A Storm of Feasibility Pumps for Nonconvex MINLP 137
Design and control of public-service contracts and an application to public transportation systems 135
null 135
CP-based Local Branching 135
Optimistic MILP modeling of non-linear optimization problems 135
Single-commodity Robust Network Design Problem: Complexity, Instances and Heuristic Solutions 135
Experiments With Two Row Tableau Cuts 135
On the Separation of Disjunctive Cuts 135
The traveling salesman problem: a book review 132
Tactical versus operational discrete event simulation: a breast screening case study 130
null 129
A Time Bucket Formulation for the TSP with Time Windows 127
A Complexity and Approximability Study of the Bilevel Knapsack Problem 127
Tspack: A unified tabu search code for multi-dimensional bin packing problems 127
Mathematical Programming Approaches to the Traveling Salesman Problem 126
Récentes avancées sur le problème de bin packing à deux dimensions. 125
Hybrid Solving Techniques 125
Projected Chvatal-Gomory cuts for Mixed Integer Linear Programs 125
Bilevel Knapsack with interdiction constraints 124
Nuovi problemi di ottimizzazione per i produttori in un mercato competitivo dell’energia elettrica 123
null 123
Optimizing over the first Chvatal closure 122
MIR closure of polyhedral sets 119
Erratum to: MIR closures of polyhedral sets 119
On Counting Lattice Points and Chvatal-Gomory Cutting Planes 119
null 118
Local Search and Constraint Programming: LS and CP illustrated on a transportation problem 117
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming 117
Nuovi problemi d’ottimizzazione per i produttori in un mercato competitivo dell’energia elettrica 116
MILP Software 116
Totale 15.089
Salva come PNG Salva come JPEG
Categoria #
all - tutte 46.162
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 46.162
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.574 0 0 0 0 0 379 500 542 503 246 116 288
2020/20212.120 446 189 63 88 27 101 22 144 246 115 126 553
2021/20226.272 354 92 758 693 760 603 630 598 672 212 481 419
2022/20232.570 262 303 147 278 250 174 108 108 494 70 257 119
2023/2024849 29 134 46 41 62 178 52 85 28 85 28 81
2024/20252.547 128 512 411 300 1.035 161 0 0 0 0 0 0
Totale 19.731