logo
科言猫学术研究的AI总结
language
手机端手机端
  • Phone Feature微信小程序
简体中文简体中文
notice消息通知
博客博客
delete
arrow
返回
F

Federica Laureana

University of Salerno

5H指数
12论文数
45被引数
收录论文 4
发表时间
logo
A New Formulation and a Branch-and-Cut Algorithm for the Set Orienteering Problem (vol 314, pg 446, 2024)
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2024-07-01
err0
PREAI
errArchetti, C.; Carrabs, F.; Cerulli, R.; Laureana, F.
err分享
err收藏
A new formulation and a branch-and-cut algorithm for the set orienteering problem集合定向问题的新公式和分支割算法
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2024-04-01
err6
PREAI
errArchetti, C.; Carrabs, F.; Cerulli, R.; Laureana, F.
err分享
err收藏
The Knapsack Problem with forfeit sets
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2023-03-01
err8
PREAI
errD'Ambrosio, Ciriaco; Laureana, Federica; Raiconi, Andrea; Vitale, Gaetano
err分享
err收藏
A genetic approach for the maximum network lifetime problem with additional operating time slot constraints具有附加操作时隙约束的最大网络寿命问题的遗传方法
errSOFT COMPUTING
IF2.5
err2020-03-11
err5
PREAI
errD'Ambrosio, Ciriaco; Iossa, Antonio; Laureana, Federica; Palmieri, Francesco
err分享
err收藏

研究方向

暂时未获取到该数据
合作学者
合作期刊
C
Claudia Archetti
H 指数: 46 · 论文数: 187
F
Francesco Palmieri
H 指数: 43 · 论文数: 357
R
Raffaele Cerulli
H 指数: 23 · 论文数: 112
C
Ciriaco D’Ambrosio
H 指数: 17 · 论文数: 82
F
Francesco Carrabs
H 指数: 16 · 论文数: 59
查看更多