Cosmin Sabo

About Cosmin Sabo

Cosmin Sabo, With an exceptional h-index of 8 and a recent h-index of 7 (since 2020), a distinguished researcher at Universitatea Technica din Cluj-Napoca, specializes in the field of Big data, Metaheuristic algorithms, Optimization problems, Mathematical modeling.

His recent articles reflect a diverse array of research interests and contributions to the field:

USING MACHINE LEARNING ALGORITHMS FOR NATURAL HABITATS ASSESSMENT

A comprehensive survey on the generalized traveling salesman problem

A diploid genetic algorithm for solving the multidimensional multi-way number partitioning problem

On the two-stage supply chain network design problem with risk-pooling and lead times

Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem

Forecasting the number of bugs and vulnerabilities in software components using neural network models

A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code

Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm

Cosmin Sabo Information

University

Position

___

Citations(all)

262

Citations(since 2020)

199

Cited By

134

hIndex(all)

8

hIndex(since 2020)

7

i10Index(all)

8

i10Index(since 2020)

6

Email

University Profile Page

Google Scholar

Cosmin Sabo Skills & Research Interests

Big data

Metaheuristic algorithms

Optimization problems

Mathematical modeling

Top articles of Cosmin Sabo

USING MACHINE LEARNING ALGORITHMS FOR NATURAL HABITATS ASSESSMENT

CARPATHIAN JOURNAL OF EARTH AND ENVIRONMENTAL SCIENCES

2024/2/1

A comprehensive survey on the generalized traveling salesman problem

2023/7/20

Ovidiu Cosma
Ovidiu Cosma

H-Index: 5

Cosmin Sabo
Cosmin Sabo

H-Index: 6

A diploid genetic algorithm for solving the multidimensional multi-way number partitioning problem

2023/7/15

On the two-stage supply chain network design problem with risk-pooling and lead times

Cybernetics and Systems

2023/4/3

Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem

Expert Systems with Applications

2023/4/1

Forecasting the number of bugs and vulnerabilities in software components using neural network models

2022/9/5

Ovidiu Cosma
Ovidiu Cosma

H-Index: 5

Cosmin Sabo
Cosmin Sabo

H-Index: 6

A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code

2022/9/5

Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm

Logic Journal of the IGPL

2022/8/19

Ovidiu Cosma
Ovidiu Cosma

H-Index: 5

Cosmin Sabo
Cosmin Sabo

H-Index: 6

A comparative study of the most important methods for forecasting the ICT systems vulnerabilities

2021/9/22

Solving the two-stage supply chain network design problem with risk-pooling and lead times by an efficient genetic algorithm

2021

On the selective vehicle routing problem

Mathematics

2020/5/12

Cosmin Sabo
Cosmin Sabo

H-Index: 6

Andrei Horvat-Marc
Andrei Horvat-Marc

H-Index: 5

An efficient hybrid genetic approach for solving the two-stage supply chain network design problem with fixed costs

Mathematics

2020/5/3

Ovidiu Cosma
Ovidiu Cosma

H-Index: 5

Cosmin Sabo
Cosmin Sabo

H-Index: 6

A novel hybrid genetic algorithm for the two-stage transportation problem with fixed charges associated to the routes

2020

Ovidiu Cosma
Ovidiu Cosma

H-Index: 5

Cosmin Sabo
Cosmin Sabo

H-Index: 6

See List of Professors in Cosmin Sabo University(Universitatea Technica din Cluj-Napoca)

Co-Authors

academic-engine