科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
A
Andrea Grosso
cnrs - institute for information sciences & technologies (ins2i)
0
H指数
1
论文数
0
被引数
0
相关解读
订阅
收录论文
14
发表时间
发表时间
IF
被引数
Graph Convolutional Branch and Bound
图卷积分支定界法
European Journal of Operational Research
IF
6
2026-03-29
0
OA
AI
Lorenzo Sciandra; Roberto Esposito; Andrea Grosso; Laura Sacerdote; Cristina Zucca
分享
收藏
Hybrid constructive heuristics for the critical node problem
关键节点问题的混合构造启发式算法
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2016-02-12
38
OA
AI
Addis, Bernardetta; Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre
分享
收藏
A single machine scheduling problem with two-dimensional vector packing constraints
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2015-05-01
18
OA
AI
Billaut, Jean-Charles; Della Croce, Federico; Grosso, Andrea
分享
收藏
Construction and improvement algorithms for dispersion problems
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2015-04-01
16
PRE
AI
Aringhieri, Roberto; Cordone, Roberto; Grosso, Andrea
分享
收藏
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2012-06-01
8
OA
AI
Della Croce, F.; Garaix, T.; Grosso, A.
分享
收藏
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2012-01-01
21
PRE
AI
Della Croce, F.; Grosso, A.
分享
收藏
Complexity of the critical node problem over trees
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2011-12-01
64
OA
AI
Di Summa, Marco; Grosso, Andrea; Locatelli, Marco
分享
收藏
A matheuristic approach for the two-machine total completion time flow shop problem
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2011-07-06
22
PRE
AI
Della Croce, Federico; Grosso, Andrea; Salassa, Fabio
分享
收藏
Computational experience with a core-based reduction procedure for the 2-knapsack problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2011-02-01
3
PRE
AI
Della Croce, F.; Grosso, A.
分享
收藏
Incidence of retinal detachment following 23-gauge vitrectomy in idiopathic epiretinal membrane surgery
ACTA OPHTHALMOLOGICA
IF
2.8
2010-05-14
8
PRE
AI
Grosso, A.; Panico, C.
分享
收藏
Finding maximin latin hypercube designs by Iterated Local Search heuristics
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2009-09-01
110
PRE
AI
Grosso, A.; Jamali, A. R. M. J. U.; Locatelli, M.
分享
收藏
A heuristic approach for the max-min diversity problem based on max-clique
基于最大团的最大-最小多样性问题的启发式方法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2009-08-01
28
PRE
AI
Della Croce, Federico; Grosso, Andrea; Locatelli, Marco
分享
收藏
Optimal facility location with random throughput costs
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2002-05-01
21
PRE
AI
Ricciardi, N; Tadei, R; Grosso, A
分享
收藏
Logical topologies design over WDM wavelength routed networks robust to traffic uncertainties
IEEE COMMUNICATIONS LETTERS
IF
4.4
2001-04-01
31
PRE
AI
Grosso, A; Leonardi, E; Mellia, M; Nucci, A
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
M
Marco Mellia
H 指数: 48 · 论文数: 463
E
Emilio Leonardi
H 指数: 40 · 论文数: 347
R
Roberto Tadei
H 指数: 38 · 论文数: 227
M
Marco Locatelli
H 指数: 35 · 论文数: 240
F
Federico Della Croce
H 指数: 30 · 论文数: 212
查看更多