Cosmin Sabo
Orcid: 0000-0002-5648-7191
According to our database1,
Cosmin Sabo
authored at least 17 papers
between 2010 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem.
Expert Syst. Appl., April, 2023
On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times.
Cybern. Syst., April, 2023
A Diploid Genetic Algorithm for Solving the Multidimensional Multi-way Number Partitioning Problem.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023
2022
Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm.
Log. J. IGPL, 2022
A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code.
Proceedings of the Hybrid Artificial Intelligent Systems - 17th International Conference, 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
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
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
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 two-level solution approach for solving the generalized minimum spanning tree problem.
Eur. J. Oper. Res., 2018
Comput. Ind. Eng., 2018
2017
A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem.
Proceedings of the Hybrid Artificial Intelligent Systems - 12th International Conference, 2017
2016
Proceedings of the International Joint Conference SOCO'16-CISIS'16-ICEUTE'16, 2016
An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems.
Proceedings of the Intelligent Systems Design and Applications, 2016
2010
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010