Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetrica C. Pop
Petrica Pop Sitar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]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)- 2023
- [j33]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) - [j32]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) - [j31]Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop:
Influence of context availability and soundness in predicting soil moisture using the Context-Aware Data Mining approach. Log. J. IGPL 31(4): 762-774 (2023) - [c58]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 - [c57]Ovidiu Cosma, Petrica C. Pop, Laura Cosma:
A Hybrid Based Genetic Algorithm for Solving the Clustered Generalized Traveling Salesman Problem. HAIS 2023: 352-362 - 2022
- [j30]Andreea Vescan, Camelia-Mihaela Pintea, Petrica C. Pop:
Test Case Prioritization - ANT Algorithm With Faults Severity. Log. J. IGPL 30(2): 277-288 (2022) - [j29]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) - [c56]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 - [c55]Cristina Ticala, Camelia-Mihaela Pintea, Simone A. Ludwig, Mara Hajdu-Macelaru, Oliviu Matei, Petrica C. Pop:
Fuzzy Index Evaluating Image Edge Detection obtained with Ant Colony Optimization. FUZZ-IEEE 2022: 1-6 - [c54]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 - [c53]Cristina Ticala, Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Oliviu Matei, Mara Hajdu-Macelaru, Petrica C. Pop:
Aspects on Image Edge Detection Based on Sensitive Swarm Intelligence. HAIS 2022: 455-465 - 2021
- [j28]Ovidiu Cosma, Petrica C. Pop, Ioana Zelina:
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem. IEEE Access 9: 15570-15591 (2021) - [j27]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Anisoara Calinescu, Corina Pop Sitar, Petrica C. Pop:
Secure traveling salesman problem with intelligent transport systems features. Log. J. IGPL 29(6): 925-935 (2021) - [c52]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 - [c51]Ovidiu Cosma, Petrica C. Pop, Laura Cosma:
An Effective Hybrid Genetic Algorithm for Solving the Generalized Traveling Salesman Problem. HAIS 2021: 113-123 - 2020
- [j26]Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop:
Context Quality Impact in Context-Aware Data Mining for Predicting Soil Moisture. Cybern. Syst. 51(7): 668-684 (2020) - [j25]Ovidiu Cosma, Petrica C. Pop, Daniela Danciulescu:
A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes. Comput. Oper. Res. 118: 104906 (2020) - [j24]Petrica C. Pop:
The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances. Eur. J. Oper. Res. 283(1): 1-15 (2020) - [j23]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop, Oliviu Matei:
Economical connections between several European countries based on TSP data. Log. J. IGPL 28(1): 33-44 (2020) - [j22]Ovidiu Cosma, Petrica C. Pop, Daniela Danciulescu:
A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem. Informatica 31(4): 681-706 (2020) - [c50]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop:
Studying Heuristics Adaptation to a Specific Degree of Fuzziness. FUZZ-IEEE 2020: 1-7 - [c49]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 - [c48]Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop, Carmen Ana Anton:
How Noisy and Missing Context Influences Predictions in a Practical Context-Aware Data Mining System. SOCO 2020: 22-32 - [c47]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
- [j21]Ovidiu Cosma, Daniela Danciulescu, Petrica C. Pop:
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers. IEEE Access 7: 113684-113698 (2019) - [j20]Camelia-Mihaela Pintea, Anisoara Calinescu, Corina Pop Sitar, Petrica C. Pop:
Towards secure & green two-stage supply chain networks. Log. J. IGPL 27(2): 137-148 (2019) - [c46]Andreea Vescan, Camelia-Mihaela Pintea, Petrica C. Pop:
Solving the Test Case Prioritization Problem with Secure Features Using Ant Colony System. CISIS-ICEUTE 2019: 67-76 - [c45]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 - [c44]Adrian Petrovan, Petrica Pop Sitar, Oliviu Matei:
Haploid Versus Diploid Genetic Algorithms. A Comparative Study. HAIS 2019: 193-205 - [c43]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 - [c42]Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop, Carmen Ana Anton:
Context-Aware Data Mining vs Classical Data Mining: Case Study on Predicting Soil Moisture. SOCO 2019: 199-208 - [c41]Ovidiu Cosma, Petrica C. Pop, Ioana Zelina:
An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs. SOCO 2019: 523-532 - 2018
- [j19]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) - [j18]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) - [j17]Andrei Horvat Marc, Levente Fuksz, Petrica C. Pop, Daniela Danciulescu:
A decomposition-based method for solving the clustered vehicle routing problem. Log. J. IGPL 26(1): 83-95 (2018) - [c40]Petrica C. Pop, Oliviu Matei, Camelia-Mihaela Pintea:
A two-level diploid genetic based algorithm for solving the family traveling salesman problem. GECCO 2018: 340-346 - [c39]Ovidiu Cosma, Petrica C. Pop, Oliviu Matei, Ioana Zelina:
A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem. HAIS 2018: 684-693 - [c38]Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Petrica C. Pop:
Towards Secure Transportation Based on Intelligent Transport Systems. Novel Approach and Concepts. SOCO-CISIS-ICEUTE 2018: 469-477 - 2017
- [j16]Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira:
The generalized traveling salesman problem solved with ant algorithms. Complex Adapt. Syst. Model. 5: 8 (2017) - [j15]Jozsef Suto, Stefan Oniga, Petrica Pop Sitar:
Feature Analysis to Human Activity Recognition. Int. J. Comput. Commun. Control 12(1): 116-130 (2017) - [c37]Camelia-Mihaela Pintea, Simone A. Ludwig, Petrica C. Pop, Oliviu Matei:
Similarities and sensitivity: Immune and ant algorithms applied towards robotics. CEC 2017: 1015-1020 - [c36]Petrica C. Pop, Oliviu Matei, Cosmin Sabo:
A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem. HAIS 2017: 149-160 - [c35]Oliviu Matei, Teodor Rusu, Andrei Bozga, Petrica Pop Sitar, Carmen Anton:
Context-Aware Data Mining: Embedding External Data Sources in a Machine Learning Process. HAIS 2017: 415-426 - 2016
- [j14]Camelia-Mihaela Pintea, Petrica C. Pop, Ioana Zelina:
Denial jamming attacks on wireless sensor network using sensitive agents. Log. J. IGPL 24(1): 92-103 (2016) - [j13]Stefka Fidanova, Petrica C. Pop:
An improved hybrid ant-local search algorithm for the partition graph coloring problem. J. Comput. Appl. Math. 293: 55-61 (2016) - [j12]Oliviu Matei, Diana Contras, Petrica C. Pop, Honoriu Valean:
Design and comparison of two evolutionary approaches for automated product design. Soft Comput. 20(11): 4257-4269 (2016) - [c34]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop, Oliviu Matei:
An Analysis of the Hardness of Novel TSP Iberian Instances. HAIS 2016: 353-364 - [c33]Cosmin Sabo, Petrica C. Pop, Honoriu Valean, Daniela Danciulescu:
An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems. ISDA 2016: 1-10 - [c32]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 - 2015
- [j11]Camelia-Mihaela Pintea, Petrica C. Pop:
An improved hybrid algorithm for capacitated fixed-charge transportation problem. Log. J. IGPL 23(3): 369-378 (2015) - [j10]Oliviu Matei, Petrica C. Pop, Jozsef Laszlo Sas, Camelia Chira:
An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem. Neurocomputing 150: 58-66 (2015) - [j9]Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar, Mara Hajdu-Macelaru:
An efficient Reverse Distribution System for solving sustainable supply chain network design problem. J. Appl. Log. 13(2): 105-113 (2015) - [c31]Andrei Horvat Marc, Levente Fuksz, Petrica C. Pop, Daniela Danciulescu:
A Novel Hybrid Algorithm for Solving the Clustered Vehicle Routing Problem. HAIS 2015: 679-689 - 2014
- [j8]Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries:
On the complexity of the selective graph coloring problem in some special classes of graphs. Theor. Comput. Sci. 540: 89-102 (2014) - [c30]Petrica C. Pop, Camelia Chira:
A hybrid approach based on genetic algorithms for solving the Clustered Vehicle Routing Problem. IEEE Congress on Evolutionary Computation 2014: 1421-1426 - [c29]Oliviu Matei, Diana Contras, Petrica C. Pop:
Applying evolutionary computation for evolving ontologies. IEEE Congress on Evolutionary Computation 2014: 1520-1527 - [c28]Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop:
On the resilience of an ant-based system in fuzzy environments. An empirical study. FUZZ-IEEE 2014: 2588-2593 - [c27]Petrica C. Pop, Levente Fuksz, Andrei Horvat Marc:
A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem. HAIS 2014: 13-24 - [c26]Stefka Fidanova, Petrica C. Pop:
An Ant Algorithm for the Partition Graph Coloring Problem. NMA 2014: 78-84 - 2013
- [j7]Oliviu Matei, Petrica C. Pop, Honoriu Valean:
Optical character recognition in real environments using neural networks and k-nearest neighbor. Appl. Intell. 39(4): 739-748 (2013) - [j6]Petrica C. Pop, Oliviu Matei, Corina Pop Sitar:
An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109: 76-83 (2013) - [c25]Petrica C. Pop, Bin Hu, Günther R. Raidl:
A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. EUROCAST (1) 2013: 219-226 - [c24]Stefan Oniga, Petrica Pop Sitar:
Application Possibilities of Hardware Implemented Hybrid Neural Networks to Support Independent Life of Elderly People. HAIS 2013: 520-529 - [c23]Levente Fuksz, Petrica C. Pop:
A Hybrid Genetic Algorithm with Variable Neighborhood Search Approach to the Number Partitioning Problem. HAIS 2013: 649-658 - [c22]Petrica C. Pop, Oliviu Matei:
Increasing the Antibandwidth of Sparse Matrices by a Genetic Algorithm. IEA/AIE 2013: 242-251 - [c21]Petrica C. Pop, Oliviu Matei:
A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem. LION 2013: 81-86 - [c20]Camelia-Mihaela Pintea, Petrica C. Pop:
Sensitive Ants for Denial Jamming Attack on Wireless Sensor Network. SOCO-CISIS-ICEUTE 2013: 409-418 - [i5]Camelia-Mihaela Pintea, Petrica C. Pop:
Sensitive Ants for Denial Jamming Attack on Wireless Sensor Network. CoRR abs/1306.0075 (2013) - [i4]Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira:
The Generalized Traveling Salesman Problem solved with Ant Algorithms. CoRR abs/1310.2350 (2013) - 2012
- [c19]Petrica C. Pop, Oliviu Matei:
A Genetic Programming Approach for Solving the Linear Ordering Problem. HAIS (2) 2012: 331-338 - [c18]Camelia-Mihaela Pintea, Corina Pop Sitar, Mara Hajdu-Macelaru, Petrica C. Pop:
A Hybrid Classical Approach to a Fixed-Charged Transportation Problem. HAIS (1) 2012: 557-566 - [c17]Oliviu Matei, Petrica C. Pop, Honoriu Valean:
A Robust Approach to Digit Recognition in Noisy Environments. IEA/AIE 2012: 606-615 - [c16]Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries:
Selective Graph Coloring in Some Special Classes of Graphs. ISCO 2012: 320-331 - [c15]Camelia-Mihaela Pintea, Petrica C. Pop:
Sensor Networks Security Based on Sensitive Robots Agents: A Conceptual Model. CISIS/ICEUTE/SOCO Special Sessions 2012: 47-56 - [c14]Camelia-Mihaela Pintea, Petrica C. Pop, Mara Hajdu-Macelaru:
Classical Hybrid Approaches on a Transportation Problem with Gas Emissions Constraints. SOCO 2012: 449-458 - [i3]Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop:
Sensitive Ants in Solving the Generalized Vehicle Routing Problem. CoRR abs/1208.5341 (2012) - [i2]Camelia-Mihaela Pintea, Petrica C. Pop:
Sensor networks security based on sensitive robots agents. A conceptual model. CoRR abs/1210.7422 (2012) - [i1]Camelia-Mihaela Pintea, Petrica C. Pop, Mara Hajdu-Macelaru:
Classical hybrid approaches on a transportation problem with gas emissions constraints. CoRR abs/1211.3218 (2012) - 2011
- [j5]Petrica C. Pop, Ioana Zelina, Vasile Lupse, Corina Pop Sitar, Camelia Chira:
Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem. Int. J. Comput. Commun. Control 6(1): 158-165 (2011) - [c13]Petrica C. Pop, Serban Iordache:
A hybrid heuristic approach for solving the generalized traveling salesman problem. GECCO 2011: 481-488 - [c12]Petrica C. Pop, Oliviu Matei:
An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming. HAIS (2) 2011: 67-74 - [c11]Petrica C. Pop, Oliviu Matei, Honoriu Valean:
An Efficient Hybrid Soft Computing Approach to the Generalized Vehicle Routing Problem. SOCO 2011: 281-289 - 2010
- [c10]Petrica C. Pop, Oliviu Matei, Corina Pop Sitar, Camelia Chira:
A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem. HAIS (2) 2010: 119-126 - [c9]Petrica C. Pop, Oliviu Matei, Cosmin Sabo:
A New Approach for Solving the Generalized Traveling Salesman Problem. Hybrid Metaheuristics 2010: 62-72
2000 – 2009
- 2008
- [c8]Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira, Dumitru Dumitrescu:
A Hybrid Ant-Based System for Gate Assignment Problem. HAIS 2008: 273-280 - [c7]Ioana Zelina, Grigor Moldovan, Petrica Pop Sitar:
Some Communication Aspects in Extended Fibonacci Cubes. SAINT 2008: 245-248 - [c6]Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop:
A Sensitive Metaheuristic for Solving a Large Optimization Problem. SOFSEM 2008: 551-559 - 2007
- [j4]Petrica C. Pop:
On the prize-collecting generalized minimum spanning tree problem. Ann. Oper. Res. 150(1): 193-204 (2007) - [c5]Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu:
Exact Algorithms for Generalized Combinatorial Optimization Problems. COCOA 2007: 154-162 - [c4]Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar:
An Ant-Based Heuristic for the Railway Traveling Salesman Problem. EvoWorkshops 2007: 702-711 - [c3]Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar, Dumitru Dumitrescu:
A Bio-Inspired Approach for a Dynamic Railway Problem. SYNASC 2007: 449-452 - 2006
- [j3]Petrica C. Pop, Walter Kern, Georg Still:
A new relaxation method for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 170(3): 900-908 (2006) - 2005
- [c2]Petrica C. Pop, Georg Still, Walter Kern:
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. ACiD 2005: 115-121 - 2004
- [j2]Petrica C. Pop:
New Models of the Generalized Minimum Spanning Tree Problem. J. Math. Model. Algorithms 3(2): 153-166 (2004) - [c1]Georgia Hadjicharalambous, Petrica C. Pop, Evangelia Pyrga, George Tsaggouris, Christos D. Zaroliagis:
The Railway Traveling Salesman Problem. ATMOS 2004: 264-275 - 2001
- [j1]Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle:
Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 8: 76-79 (2001)
Coauthor Index
a service of 
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-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
