A New Approach for Solving the Generalized Traveling Salesman Problem. - Petrica C. Pop; Oliviu Matei; Cosmin Sabo (Hybrid Metaheuristics, 2010)

An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems. - Cosmin Sabo; Petrica C. Pop; Honoriu Valean; Daniela Danciulescu (ISDA, 2016)

Towards a Secure Two-Stage Supply Chain Network: A Transportation-Cost Approach. - Camelia-Mihaela Pintea; Anisoara Calinescu; Petrica C. Pop; Cosmin Sabo (SOCO-CISIS-ICEUTE, 2016)

A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem. - Petrica C. Pop; Oliviu Matei; Cosmin Sabo (HAIS, 2017)

A novel two-level optimization approach for clustered vehicle routing problem. - Petrica C. Pop; Levente Fuksz; Andrei Horvat Marc; Cosmin Sabo (Comput. Ind. Eng., 2018)

A two-level solution approach for solving the generalized minimum spanning tree problem. - Petrica C. Pop; Oliviu Matei; Cosmin Sabo; Adrian Petrovan (Eur. J. Oper. Res., 2018)

An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem. - Ovidiu Cosma; Petrica C. Pop; Cosmin Sabo (HAIS, 2019)

An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes. - Ovidiu Cosma; Petrica C. Pop; Cosmin Sabo (ITQM, 2019)

A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes. - Ovidiu Cosma; Petrica C. Pop; Cosmin Sabo (SOFSEM, 2020)

Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm. - Ovidiu Cosma; Petrica C. Pop; Cosmin Sabo (SOCO, 2020)

A Comparative Study of the Most Important Methods for Forecasting the ICT Systems Vulnerabilities. - Ovidiu Cosma; Mara Macelaru; Petrica C. Pop; Cosmin Sabo; Ioana Zelina (CISIS-ICEUTE, 2021)

Forecasting the Number of Bugs and Vulnerabilities in Software Components Using Neural Network Models. - Ovidiu Cosma; Petrica C. Pop; Cosmin Sabo; Laura Cosma (CISIS-ICEUTE, 2022)

A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code. - Adrian Petrovan; Petrica C. Pop; Cosmin Sabo; Ioana Zelina (HAIS, 2022)

Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm. - Ovidiu Cosma; Petrica C. Pop; Cosmin Sabo (Log. J. IGPL, 2022)

A Diploid Genetic Algorithm for Solving the Multidimensional Multi-way Number Partitioning Problem. - Adrian Petrovan; Petrica C. Pop; Cosmin Sabo; Oliviu Matei (GECCO Companion, 2023)

On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times. - Ovidiu Cosma; Petrica C. Pop; Cosmin Sabo (Cybern. Syst., 2023)

Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem. - Adrian Petrovan; Petrica C. Pop; Cosmin Sabo; Ioana Zelina (Expert Syst. Appl., 2023)

Diversity Population Metrics in Diploid and Haploid Genetic Algorithm Variants. - Adrian Petrovan; Oliviu Matei; Petrica C. Pop; Cosmin Sabo (HAIS (1), 2024)

Solving the Clustered Minimum Routing Tree Problem Using Prüfer-Coding Based Hybrid Genetic Algorithms. - Cosmin Sabo; Bogdan Teglas; Petrica C. Pop; Adrian Petrovan (HAIS (1), 2024)

On the Design of Diploid Memetic Algorithms for Solving the Multidimensional Multi-way Number Partitioning Problem. - Adrian Petrovan; Petrica C. Pop; Cosmin Sabo (PPSN (1), 2024)

A Comparative Study of Different Genetic Algorithms Approaches to Capacitated Vehicle Routing Problem for Collection of Agricultural Products. - Cosmin Sabo; Natanael Balogh; Petrica C. Pop; Adrian Petrovan (SOCO (2), 2024)

A comprehensive survey on the generalized traveling salesman problem. - Petrica C. Pop; Ovidiu Cosma; Cosmin Sabo; Corina Pop Sitar (Eur. J. Oper. Res., 2024)

An improved diploid memetic algorithm for solving the multidimensional multi-way number partitioning problem. - Adrian Petrovan; Petrica C. Pop; Cosmin Sabo (Expert Syst. Appl., 2025)