Ovidiu Cosma

22 papers B 1Misc 4Journal 9Unranked 8
YearRankTypeTitle / Venue / Authors
2025 J jnl
A comparative study of neural network architectures for software vulnerability forecasting.
Log. J. IGPL
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
2025 — conf
Ensemble Deep Learning Model for AI-Powered Cyber-Physical Systems in Precision Agriculture.
DoCEIS
Laura Cosma, Stefan Vasile Oniga, Ovidiu Cosma
2024 — conf
A Novel CNN Approach for Accurate Tomato Disease Classification.
ICE/ITMC
Ovidiu Cosma, Laura Cosma
2024 J jnl
A comprehensive survey on the generalized traveling salesman problem.
Eur. J. Oper. Res.
Petrica C. Pop, Ovidiu Cosma, Cosmin Sabo, Corina Pop Sitar
2024 J jnl
A novel memetic algorithm for solving the generalized traveling salesman problem.
Log. J. IGPL
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
2024 — conf
TPC_Net: An Efficient CNN Architecture for Tomato Plant Disease and Pest Classification.
SOCO (2)
Ovidiu Cosma, Laura Cosma
2023 Misc conf
A Hybrid Based Genetic Algorithm for Solving the Clustered Generalized Traveling Salesman Problem.
HAIS
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
2023 J jnl
On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times.
Cybern. Syst.
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2022 — conf
Forecasting the Number of Bugs and Vulnerabilities in Software Components Using Neural Network Models.
CISIS-ICEUTE
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo, Laura Cosma
2022 J jnl
Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm.
Log. J. IGPL
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2021 — conf
A Comparative Study of the Most Important Methods for Forecasting the ICT Systems Vulnerabilities.
CISIS-ICEUTE
Ovidiu Cosma, Mara Macelaru, Petrica C. Pop, Cosmin Sabo, Ioana Zelina
2021 J jnl
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem.
IEEE Access
Ovidiu Cosma, Petrica C. Pop, Ioana Zelina
2021 Misc conf
An Effective Hybrid Genetic Algorithm for Solving the Generalized Traveling Salesman Problem.
HAIS
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
2020 B conf
A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes.
SOFSEM
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2020 J jnl
A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem.
Informatica
Ovidiu Cosma, Petrica C. Pop, Daniela Danciulescu
2020 J jnl
A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes.
Comput. Oper. Res.
Ovidiu Cosma, Petrica C. Pop, Daniela Danciulescu
2020 — conf
Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm.
SOCO
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2019 Misc conf
An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem.
HAIS
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2019 — conf
An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs.
SOCO
Ovidiu Cosma, Petrica C. Pop, Ioana Zelina
2019 — conf
An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes.
ITQM
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2019 J jnl
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers.
IEEE Access
Ovidiu Cosma, Daniela Danciulescu, Petrica C. Pop
2018 Misc conf
A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem.
HAIS
Ovidiu Cosma, Petrica C. Pop, Oliviu Matei, Ioana Zelina