| A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes O Cosma, PC Pop, D Dănciulescu Computers & Operations Research 118, 104906, 2020 | 23 | 2020 |
| On the two-stage transportation problem with fixed charge for opening the distribution centers O Cosma, D Dănciulescu, PC Pop IEEE Access 7, 113684-113698, 2019 | 13 | 2019 |
| An effective genetic algorithm for solving the clustered shortest-path tree problem O Cosma, PC Pop, I Zelina IEEE Access 9, 15570-15591, 2021 | 11 | 2021 |
| A hybrid iterated local search for solving a particular two-stage fixed-charge transportation problem O Cosma, P Pop, M Oliviu, I Zelina Hybrid Artificial Intelligent Systems: 13th International Conference, HAIS …, 2018 | 11 | 2018 |
| Image dithering based on the wavelet transform O Cosma Proceedings of the International Conference on Theory and Applications of …, 2004 | 11 | 2004 |
| An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem O Cosma, PC Pop, CP Sitar Carpathian Journal of Mathematics 35 (2), 153-164, 2019 | 10 | 2019 |
| Contributions to the coding of image subbands O Cosma thesis, Politehnica University Bucharest, 2003 | 9 | 2003 |
| An efficient hybrid genetic approach for solving the two-stage supply chain network design problem with fixed costs O Cosma, PC Pop, C Sabo Mathematics 8 (5), 712, 2020 | 8 | 2020 |
| A comparison of some fixed point iteration procedures by using the basins of attraction G Ardelean, O Cosma, L Balog Carpathian Journal of Mathematics, 277-284, 2016 | 8 | 2016 |
| ERP extension-Supply chain management (SCM) V Lupse, O Cosma Informática económica 10 (2), 120-124, 2006 | 8 | 2006 |
| A parallel algorithm for solving a two-stage fixed-charge transportation problem O Cosma, PC Pop, D Dănciulescu Informatica 31 (4), 681-706, 2020 | 7 | 2020 |
| Wavelet Transform application in image compression O COSMA Buletinul științific al Universitatii Baia Mare, Seria B, Fascicola …, 2000 | 7 | 2000 |
| A novel genetic algorithm for solving the clustered shortest-path tree problem O Cosma, PC Pop, I Zelina Carpathian Journal of Mathematics 36 (3), 401-414, 2020 | 6 | 2020 |
| A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem O Cosma, PC Pop, CP Sitar Carpathian Journal of Mathematics 38 (1), 117-128, 2022 | 5 | 2022 |
| An effective hybrid genetic algorithm for solving the generalized traveling salesman problem O Cosma, PC Pop, L Cosma Hybrid Artificial Intelligent Systems: 16th International Conference, HAIS …, 2021 | 5 | 2021 |
| Comparison of various epson smart glasses in terms of real functionality and capabilities O Matei, I Vlad, R Heb, A Moga, O Szika, O Cosma Carpathian Journal of Electrical Engineering 10 (1), 31-38, 2016 | 5 | 2016 |
| An efficient soft computing approach for solving the two-stage transportation problem with fixed costs O Cosma, P Pop, I Zelina 14th International Conference on Soft Computing Models in Industrial and …, 2020 | 4 | 2020 |
| An elementary geometric construction performed by a computer V BERINDE, O COSMA Buletinul științific al Universitatii Baia Mare, Seria B, Fascicola …, 1994 | 4 | 1994 |
| On the two-stage supply chain network design problem with risk-pooling and lead times O Cosma, P Pop, C Sabo Cybernetics and Systems 54 (3), 321-338, 2023 | 2 | 2023 |
| Forecasting the Number of Bugs and Vulnerabilities in Software Components using Neural Network Models O Cosma, P Pop, C Sabo, L Cosma International Joint Conference 15th International Conference on …, 2022 | 2 | 2022 |
Petrica PopTechnical University Cluj Napoca, CUNBMAdresă de e-mail confirmată pe ubm.ro
