default search action
Cosmin Sabo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Petrica C. Pop, Ovidiu Cosma, Cosmin Sabo, Corina Pop Sitar:
A comprehensive survey on the generalized traveling salesman problem. Eur. J. Oper. Res. 314(3): 819-835 (2024) - [c15]Cosmin Sabo, Bogdan Teglas, Petrica C. Pop, Adrian Petrovan:
Solving the Clustered Minimum Routing Tree Problem Using Prüfer-Coding Based Hybrid Genetic Algorithms. HAIS (1) 2024: 312-323 - [c14]Adrian Petrovan, Oliviu Matei, Petrica C. Pop, Cosmin Sabo:
Diversity Population Metrics in Diploid and Haploid Genetic Algorithm Variants. HAIS (1) 2024: 324-338 - [c13]Adrian Petrovan, Petrica C. Pop, Cosmin Sabo:
On the Design of Diploid Memetic Algorithms for Solving the Multidimensional Multi-way Number Partitioning Problem. PPSN (1) 2024: 3-19 - 2023
- [j5]Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo:
On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times. Cybern. Syst. 54(3): 321-338 (2023) - [j4]Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina:
Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem. Expert Syst. Appl. 215: 119372 (2023) - [c12]Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Oliviu Matei:
A Diploid Genetic Algorithm for Solving the Multidimensional Multi-way Number Partitioning Problem. GECCO Companion 2023: 231-234 - 2022
- [j3]Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo:
Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm. Log. J. IGPL 30(4): 622-634 (2022) - [c11]Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo, Laura Cosma:
Forecasting the Number of Bugs and Vulnerabilities in Software Components Using Neural Network Models. CISIS-ICEUTE 2022: 159-168 - [c10]Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina:
A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code. HAIS 2022: 323-334 - 2021
- [c9]Ovidiu Cosma, Mara Macelaru, Petrica C. Pop, Cosmin Sabo, Ioana Zelina:
A Comparative Study of the Most Important Methods for Forecasting the ICT Systems Vulnerabilities. CISIS-ICEUTE 2021: 224-233 - 2020
- [c8]Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo:
A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes. SOFSEM 2020: 417-428 - [c7]Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo:
Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm. SOCO 2020: 509-519
2010 – 2019
- 2019
- [c6]Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo:
An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem. HAIS 2019: 157-167 - [c5]Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo:
An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes. ITQM 2019: 900-907 - 2018
- [j2]Petrica C. Pop, Levente Fuksz, Andrei Horvat Marc, Cosmin Sabo:
A novel two-level optimization approach for clustered vehicle routing problem. Comput. Ind. Eng. 115: 304-318 (2018) - [j1]Petrica C. Pop, Oliviu Matei, Cosmin Sabo, Adrian Petrovan:
A two-level solution approach for solving the generalized minimum spanning tree problem. Eur. J. Oper. Res. 265(2): 478-487 (2018) - 2017
- [c4]Petrica C. Pop, Oliviu Matei, Cosmin Sabo:
A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem. HAIS 2017: 149-160 - 2016
- [c3]Cosmin Sabo, Petrica C. Pop, Honoriu Valean, Daniela Danciulescu:
An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems. ISDA 2016: 1-10 - [c2]Camelia-Mihaela Pintea, Anisoara Calinescu, Petrica C. Pop, Cosmin Sabo:
Towards a Secure Two-Stage Supply Chain Network: A Transportation-Cost Approach. SOCO-CISIS-ICEUTE 2016: 547-554 - 2010
- [c1]Petrica C. Pop, Oliviu Matei, Cosmin Sabo:
A New Approach for Solving the Generalized Traveling Salesman Problem. Hybrid Metaheuristics 2010: 62-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint