A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem. - Ovidiu Cosma; Petrica C. Pop; Oliviu Matei; Ioana Zelina (HAIS, 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)

An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs. - Ovidiu Cosma; Petrica C. Pop; Ioana Zelina (SOCO, 2019)

On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers. - Ovidiu Cosma; Daniela Danciulescu; Petrica C. Pop (IEEE Access, 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 novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes. - Ovidiu Cosma; Petrica C. Pop; Daniela Danciulescu (Comput. Oper. Res., 2020)

A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem. - Ovidiu Cosma; Petrica C. Pop; Daniela Danciulescu (Informatica, 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)

An Effective Hybrid Genetic Algorithm for Solving the Generalized Traveling Salesman Problem. - Ovidiu Cosma; Petrica C. Pop; Laura Cosma (HAIS, 2021)

An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem. - Ovidiu Cosma; Petrica C. Pop; Ioana Zelina (IEEE Access, 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)

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 Hybrid Based Genetic Algorithm for Solving the Clustered Generalized Traveling Salesman Problem. - Ovidiu Cosma; Petrica C. Pop; Laura Cosma (HAIS, 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)

A Novel CNN Approach for Accurate Tomato Disease Classification. - Ovidiu Cosma; Laura Cosma (ICE/ITMC, 2024)

TPC_Net: An Efficient CNN Architecture for Tomato Plant Disease and Pest Classification. - Ovidiu Cosma; Laura Cosma (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)

A novel memetic algorithm for solving the generalized traveling salesman problem. - Ovidiu Cosma; Petrica C. Pop; Laura Cosma (Log. J. IGPL, 2024)

Ensemble Deep Learning Model for AI-Powered Cyber-Physical Systems in Precision Agriculture. - Laura Cosma; Stefan Vasile Oniga; Ovidiu Cosma (DoCEIS, 2025)