科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
O
Ovidiu Cosma
Technical University of Cluj Napoca
11
H指数
40
论文数
369
被引数
0
相关解读
订阅
收录论文
5
发表时间
发表时间
IF
被引数
A comprehensive survey on the generalized traveling salesman problem
广义旅行商问题综述
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2024-05-01
37
OA
AI
Pop, Petrica C.; Cosma, Ovidiu; Sabo, Cosmin; Sitar, Corina Pop
分享
收藏
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
IEEE ACCESS
IF
3.6
2021-01-01
19
OA
AI
Cosma, Ovidiu; Pop, Petrica C.; Zelina, Ioana
分享
收藏
A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem
求解两阶段固定费用运输问题的并行算法
Informatica
IF
2.8
2020-10-15
7
PRE
AI
Cosma, Ovidiu; Pop, Petrica C.; Danciulescu, Daniela
分享
收藏
A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2020-06-01
23
PRE
AI
Cosma, Ovidiu; Pop, Petrica C.; Danciulescu, Daniela
分享
收藏
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers
IEEE ACCESS
IF
3.6
2019-01-01
8
OA
AI
Cosma, Ovidiu; Danciulescu, Daniela; Pop, Petrica C.
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
P
Petrică C. Pop
H 指数: 24 · 论文数: 155
C
Corina Pop Sitar
H 指数: 11 · 论文数: 34
D
Daniela Dănciulescu
H 指数: 9 · 论文数: 60
C
Cosmin Sabo
H 指数: 9 · 论文数: 36
I
Ioana Zelina
H 指数: 8 · 论文数: 24
已加载全部