Ovidiu Cosma

Orcid: 0000-0001-9740-5394

According to our database1, Ovidiu Cosma authored at least 17 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A comprehensive survey on the generalized traveling salesman problem.
Eur. J. Oper. Res., 2024

2023
On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times.
Cybern. Syst., April, 2023

A Hybrid Based Genetic Algorithm for Solving the Clustered Generalized Traveling Salesman Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 18th International Conference, 2023

2022
Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm.
Log. J. IGPL, 2022

Forecasting the Number of Bugs and Vulnerabilities in Software Components Using Neural Network Models.
Proceedings of the International Joint Conference 15th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2022) 13th International Conference on EUropean Transnational Education (ICEUTE 2022), 2022

2021
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem.
IEEE Access, 2021

An Effective Hybrid Genetic Algorithm for Solving the Generalized Traveling Salesman Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 16th International Conference, 2021

A Comparative Study of the Most Important Methods for Forecasting the ICT Systems Vulnerabilities.
Proceedings of the 14th International Conference on Computational Intelligence in Security for Information Systems and 12th International Conference on European Transnational Educational (CISIS 2021 and ICEUTE 2021), 2021

2020
A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem.
Informatica, 2020

A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes.
Comput. Oper. Res., 2020

Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm.
Proceedings of the 15th International Conference on Soft Computing Models in Industrial and Environmental Applications, 2020

A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers.
IEEE Access, 2019

An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs.
Proceedings of the 14th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2019), 2019

An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes.
Proceedings of the 7th International Conference on Information Technology and Quantitative Management, 2019

An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 14th International Conference, 2019

2018
A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 13th International Conference, 2018


  Loading...