Get started
Author

Cosmin Sabo

Observed names: C. Sabo, COSMIN SABO, Cosmin SABO, Cosmin-Nicolae Sabo
ORCID: 0000-0002-5648-7191
Observed ORCID: 0000-0002-5648-7191
OpenAlex ID: A5019466406
A comprehensive survey on the generalized traveling salesman problem
2023 · Petrică C. Pop, Ovidiu Cosma, et al. · European Journal of Operational Research · 207
A novel two-level optimization approach for clustered vehicle routing problem
2017 · Petrica C. Pop, Levente Fuksz, et al. · Computers & Industrial Engineering · 55
A two-level solution approach for solving the generalized minimum spanning tree problem
2017 · Petrică C. Pop, Oliviu Matei, et al. · European Journal of Operational Research · 48
Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm
2017 · PETRICA C. POP, COSMIN SABO, et al. · Carpathian Journal of Mathematics · 27
PDF
On the Selective Vehicle Routing Problem
2020 · Cosmin Sabo, Petrică C. Pop, et al. · Mathematics · 22
A New Approach for Solving the Generalized Traveling Salesman Problem
2010 · P. C. Pop, O. Matei, et al. · Lecture notes in computer science · 21
A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem
2017 · Petrica Pop, Matei Oliviu, et al. · Lecture notes in computer science · 19
An Efficient Hybrid Genetic Approach for Solving the Two-Stage Supply Chain Network Design Problem with Fixed Costs
2020 · Ovidiu Cosma, Petrică C. Pop, et al. · Mathematics · 17
Novel Two-Level Hybrid Genetic Algorithms Based on Different Cayley-Typeencodings for Solving the Clustered Shortest-Path Tree Problem
2022 · Adrian Petrovan, Petrică Pop, et al. · Expert Systems with Applications · 14
A Diploid Genetic Algorithm for Solving the Multidimensional Multi-way Number Partitioning Problem
2023 · Adrian Petrovan, Petrica Pop, et al. · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · 7
Towards a Secure Two-Stage Supply Chain Network: A Transportation-Cost Approach
2016 · Camelia-M. Pintea, Anisoara Calinescu, et al. · Advances in intelligent systems and computing · 7
A Comparative Study of the Most Important Methods for Forecasting the ICT Systems Vulnerabilities
2021 · O. Cosma, M. Macelaru, et al. · Advances in intelligent systems and computing · 6
Forecasting the Number of Bugs and Vulnerabilities in Software Components Using Neural Network Models
2022 · Ovidiu Cosma, Petrică Pop, et al. · Lecture notes in networks and systems · 4
On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times
2022 · Ovidiu Cosma, Petrica Pop, et al. · Cybernetics & Systems · 4
Comments on “A two-stage supply chain problem with fixed costs: An ant colony optimization approach” by Hong et al. International Journal of Production Economics (2018)
2019 · COSMIN SABO, ANDREI HORVAT MARC, et al. · Creative Mathematics and Informatics · 4
An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes
2019 · Ovidiu Cosma, Petrica Pop, et al. · Procedia Computer Science · 4
An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem
2019 · Ovidiu Cosma, Petrica C. Pop, et al. · Lecture notes in computer science · 3
An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems
2017 · Cosmin Sabo, Petrică C. Pop, et al. · Advances in intelligent systems and computing · 3
Implementation of a UDC-Based Multilingual Thesaurus in a Library Catalogue: The Case of BiblioPhil
2010 · Victoria Frâncu, Cosmin-Nicolae Sabo · KNOWLEDGE ORGANIZATION · 3
PDF
An improved diploid memetic algorithm for solving the multidimensional multi-way number partitioning problem
2025 · Adrian Petrovan, Petrică Pop, et al. · Expert Systems with Applications · 2
Solving the Clustered Minimum Routing Tree Problem Using Prüfer-Coding Based Hybrid Genetic Algorithms
2024 · Cosmin Sabo, Bogdan Teglas, et al. · Lecture notes in computer science · 2
A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes
2020 · Ovidiu Cosma, Petrica C. Pop, et al. · Lecture notes in computer science · 2
A Memetic Algorithm for Solving the Generalized Minimum Spanning Tree Problem
2011 · Petrică Pop, Oliviu Matei, et al. · Advances in intelligent and soft computing · 2
Positive solutions of Urysohn integral equations
2007 · Andrei Horvat-Marc, Cosmin Sabo, et al. · 2
Competition between Dandelion and Prufer encoded genetic algorithms for solving the clustered minimum routing tree problem
2025 · COSMIN SABO, PETRICĂ C. POP, et al. · Carpathian Journal of Mathematics · 1
PDF
Works count: 37
Citation count: 490
H-index: 9
I10-index: 9
Year
Topic
Type