Canyam
AI summaries for academic research
Home
Preprint
Subscribe
Favorites
Tools
Analysis
Summary
Not logged in
Back
C
Cosmin Sabo
Technical University of Cluj Napoca
9
H-index
35
Paper Count
386
Citation Count
0
Related Insights
Subscribe
Published Papers
5
Publication Date
Publication Date
Impact Factor
Citations
An Adaptive Memetic Algorithm for Solving the Multiple Knapsack Assignment Problem
HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, HAIS 2025, PT II
IF
0
2026-01-01
0
PRE
AI
Petrovan, Adrian; Pop, Petrica. C.; Sabo, Cosmin
Share
Save
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
Share
Save
Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem
EXPERT SYSTEMS WITH APPLICATIONS
IF
7.5
2023-04-01
6
PRE
AI
Petrovan, Adrian; Pop, Petrica; Sabo, Cosmin; Zelina, Ioana
Share
Save
A two-level solution approach for solving the generalized minimum spanning tree problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2018-03-01
39
PRE
AI
Pop, Petrica C.; Matei, Oliviu; Sabo, Cosmin; Petrovan, Adrian
Share
Save
A novel two-level optimization approach for clustered vehicle routing problem
COMPUTERS & INDUSTRIAL ENGINEERING
IF
6.5
2018-01-01
41
PRE
AI
Pop, Petrica C.; Fuksz, Levente; Marc, Andrei Horvat; Sabo, Cosmin
Share
Save
Research Directions
No research directions
Co-authors
Cooperation Journals
P
Petrică C. Pop
H-index: 24 · Papers: 155
O
Oliviu Matei
H-index: 16 · Papers: 139
C
Corina Pop Sitar
H-index: 11 · Papers: 34
O
Ovidiu Cosma
H-index: 11 · Papers: 40
A
Andrei Horvat-Marc
H-index: 8 · Papers: 24
View more