Petrica C. Pop

108 papers A 2B 10C 6Misc 13Journal 41Unranked 36
YearRankTypeTitle / Venue / Authors
2026 — conf
Blockchain and IoT for Transparency and Traceability in Supply Chain Management.
ICAART (5)
Elias-Nelu Dejan, Mara Hajdu-Macelaru, Petrica C. Pop
2025 — conf
A Comparative Analysis of the Algorithm Results for Designing Two-Stage Supply Chains with Fixed Costs.
OLA
Corina Pop Sitar, Petrica C. Pop, Adrian Petrovan
2025 B conf
A Prüfer-based genetic algorithm for solving a non-linear multi-objective fixed-charge transportation problem.
SMC
Cristian Pop, Petrica C. Pop, Adrian Petrovan
2025 J jnl
A comparative study of neural network architectures for software vulnerability forecasting.
Log. J. IGPL
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
2025 — conf
An Adaptive Memetic Algorithm for Solving the Multiple Knapsack Assignment Problem.
HAIS (2)
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo
2025 — conf
An Enhanced Hybrid Machine Learning Model for Plant Disease Detection and Classification.
HAIS (1)
Mara Macelaru, Petrica C. Pop, Rares Chiuzbaian, Norbert Kovacs
2025 B conf
An Improved Pareto Front for the Non-Linear Multi-Objective Fixed Cost Transportation Problem.
CEC
Cristian Pop, Petrica C. Pop, Adrian Petrovan
2025 J jnl
An improved diploid memetic algorithm for solving the multidimensional multi-way number partitioning problem.
Expert Syst. Appl.
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo
2025 — conf
Emerging Technologies Acceptance Within the Romanian Educational System: A Case Study Using the UTAUT Model.
CSEDU (1)
Corina Pop Sitar, Mara Hajdu-Macelaru, Petrica C. Pop
2025 — conf
Machine Learning Approaches in the Detection of Amyotrophic Lateral Sclerosis Disease Using Orofacial Gestures.
ICAART (3)
Mara Hajdu-Macelaru, Rares Chiuzbaian, Petrica C. Pop
2024 — conf
A Comparative Study of Different Genetic Algorithms Approaches to Capacitated Vehicle Routing Problem for Collection of Agricultural Products.
SOCO (2)
Cosmin Sabo, Natanael Balogh, Petrica C. Pop, Adrian Petrovan
2024 — conf
A Comparative Study of Machine Learning Models for Plant Disease Identification.
SOCO (2)
Mara Macelaru, Petrica C. Pop, José Barata
2024 J jnl
A comprehensive survey on the generalized traveling salesman problem.
Eur. J. Oper. Res.
Petrica C. Pop, Ovidiu Cosma, Cosmin Sabo, Corina Pop Sitar
2024 J jnl
A novel memetic algorithm for solving the generalized traveling salesman problem.
Log. J. IGPL
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
2024 — conf
Diversity Population Metrics in Diploid and Haploid Genetic Algorithm Variants.
HAIS (1)
Adrian Petrovan, Oliviu Matei, Petrica C. Pop, Cosmin Sabo
2024 — conf
On the Design of Diploid Memetic Algorithms for Solving the Multidimensional Multi-way Number Partitioning Problem.
PPSN (1)
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo
2024 — conf
Solving the Clustered Minimum Routing Tree Problem Using Prüfer-Coding Based Hybrid Genetic Algorithms.
HAIS (1)
Cosmin Sabo, Bogdan Teglas, Petrica C. Pop, Adrian Petrovan
2023 — conf
A Diploid Genetic Algorithm for Solving the Multidimensional Multi-way Number Partitioning Problem.
GECCO Companion
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Oliviu Matei
2023 Misc conf
A Hybrid Based Genetic Algorithm for Solving the Clustered Generalized Traveling Salesman Problem.
HAIS
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
2023 J jnl
Influence of context availability and soundness in predicting soil moisture using the Context-Aware Data Mining approach.
Log. J. IGPL
Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop
2023 J jnl
Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem.
Expert Syst. Appl.
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina
2023 J jnl
On the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times.
Cybern. Syst.
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2022 Misc conf
A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code.
HAIS
Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina
2022 Misc conf
Aspects on Image Edge Detection Based on Sensitive Swarm Intelligence.
HAIS
Cristina Ticala, Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Oliviu Matei, Mara Hajdu-Macelaru, Petrica C. Pop
2022 — conf
Forecasting the Number of Bugs and Vulnerabilities in Software Components Using Neural Network Models.
CISIS-ICEUTE
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo, Laura Cosma
2022 B conf
Fuzzy Index Evaluating Image Edge Detection obtained with Ant Colony Optimization.
FUZZ-IEEE
Cristina Ticala, Camelia-Mihaela Pintea, Simone A. Ludwig, Mara Hajdu-Macelaru, Oliviu Matei, Petrica C. Pop
2022 J jnl
Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm.
Log. J. IGPL
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2022 J jnl
Test Case Prioritization - ANT Algorithm With Faults Severity.
Log. J. IGPL
Andreea Vescan, Camelia-Mihaela Pintea, Petrica C. Pop
2021 — conf
A Comparative Study of the Most Important Methods for Forecasting the ICT Systems Vulnerabilities.
CISIS-ICEUTE
Ovidiu Cosma, Mara Macelaru, Petrica C. Pop, Cosmin Sabo, Ioana Zelina
2021 J jnl
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem.
IEEE Access
Ovidiu Cosma, Petrica C. Pop, Ioana Zelina
2021 Misc conf
An Effective Hybrid Genetic Algorithm for Solving the Generalized Traveling Salesman Problem.
HAIS
Ovidiu Cosma, Petrica C. Pop, Laura Cosma
2021 J jnl
Secure traveling salesman problem with intelligent transport systems features.
Log. J. IGPL
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Anisoara Calinescu, Corina Pop Sitar, Petrica C. Pop
2020 B conf
A Novel Hybrid Genetic Algorithm for the Two-Stage Transportation Problem with Fixed Charges Associated to the Routes.
SOFSEM
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2020 J jnl
A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem.
Informatica
Ovidiu Cosma, Petrica C. Pop, Daniela Danciulescu
2020 J jnl
A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes.
Comput. Oper. Res.
Ovidiu Cosma, Petrica C. Pop, Daniela Danciulescu
2020 J jnl
Context Quality Impact in Context-Aware Data Mining for Predicting Soil Moisture.
Cybern. Syst.
Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop
2020 J jnl
Economical connections between several European countries based on TSP data.
Log. J. IGPL
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop, Oliviu Matei
2020 — conf
How Noisy and Missing Context Influences Predictions in a Practical Context-Aware Data Mining System.
SOCO
Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop, Carmen Ana Anton
2020 — conf
Solving the Two-Stage Supply Chain Network Design Problem with Risk-Pooling and Lead Times by an Efficient Genetic Algorithm.
SOCO
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2020 B conf
Studying Heuristics Adaptation to a Specific Degree of Fuzziness.
FUZZ-IEEE
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop
2020 J jnl
The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances.
Eur. J. Oper. Res.
Petrica C. Pop
2019 Misc conf
An Efficient Hybrid Genetic Algorithm for Solving a Particular Two-Stage Fixed-Charge Transportation Problem.
HAIS
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2019 — conf
An Efficient Soft Computing Approach for Solving the Two-Stage Transportation Problem with Fixed Costs.
SOCO
Ovidiu Cosma, Petrica C. Pop, Ioana Zelina
2019 — conf
An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes.
ITQM
Ovidiu Cosma, Petrica C. Pop, Cosmin Sabo
2019 — conf
Context-Aware Data Mining vs Classical Data Mining: Case Study on Predicting Soil Moisture.
SOCO
Anca Avram, Oliviu Matei, Camelia-Mihaela Pintea, Petrica C. Pop, Carmen Ana Anton
2019 J jnl
On the Two-Stage Transportation Problem With Fixed Charge for Opening the Distribution Centers.
IEEE Access
Ovidiu Cosma, Daniela Danciulescu, Petrica C. Pop
2019 — conf
Solving the Test Case Prioritization Problem with Secure Features Using Ant Colony System.
CISIS-ICEUTE
Andreea Vescan, Camelia-Mihaela Pintea, Petrica C. Pop
2019 J jnl
Towards secure & green two-stage supply chain networks.
Log. J. IGPL
Camelia-Mihaela Pintea, Anisoara Calinescu, Corina Pop Sitar, Petrica C. Pop
2018 Misc conf
A Hybrid Iterated Local Search for Solving a Particular Two-Stage Fixed-Charge Transportation Problem.
HAIS
Ovidiu Cosma, Petrica C. Pop, Oliviu Matei, Ioana Zelina
2018 J jnl
A decomposition-based method for solving the clustered vehicle routing problem.
Log. J. IGPL
Andrei Horvat Marc, Levente Fuksz, Petrica C. Pop, Daniela Danciulescu
2018 J jnl
A novel two-level optimization approach for clustered vehicle routing problem.
Comput. Ind. Eng.
Petrica C. Pop, Levente Fuksz, Andrei Horvat Marc, Cosmin Sabo
2018 A conf
A two-level diploid genetic based algorithm for solving the family traveling salesman problem.
GECCO
Petrica C. Pop, Oliviu Matei, Camelia-Mihaela Pintea
2018 J jnl
A two-level solution approach for solving the generalized minimum spanning tree problem.
Eur. J. Oper. Res.
Petrica C. Pop, Oliviu Matei, Cosmin Sabo, Adrian Petrovan
2018 — conf
Towards Secure Transportation Based on Intelligent Transport Systems. Novel Approach and Concepts.
SOCO-CISIS-ICEUTE
Camelia-Mihaela Pintea, Gloria Cerasela Crisan, Petrica C. Pop
2017 Misc conf
A Hybrid Diploid Genetic Based Algorithm for Solving the Generalized Traveling Salesman Problem.
HAIS
Petrica C. Pop, Oliviu Matei, Cosmin Sabo
2017 B conf
Similarities and sensitivity: Immune and ant algorithms applied towards robotics.
CEC
Camelia-Mihaela Pintea, Simone A. Ludwig, Petrica C. Pop, Oliviu Matei
2017 J jnl
The generalized traveling salesman problem solved with ant algorithms.
Complex Adapt. Syst. Model.
Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira
2016 Misc conf
An Analysis of the Hardness of Novel TSP Iberian Instances.
HAIS
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop, Oliviu Matei
2016 C conf
An Innovative Approach to Manage Heterogeneous Information Using Relational Database Systems.
ISDA
Cosmin Sabo, Petrica C. Pop, Honoriu Valean, Daniela Danciulescu
2016 J jnl
An improved hybrid ant-local search algorithm for the partition graph coloring problem.
J. Comput. Appl. Math.
Stefka Fidanova, Petrica C. Pop
2016 J jnl
Denial jamming attacks on wireless sensor network using sensitive agents.
Log. J. IGPL
Camelia-Mihaela Pintea, Petrica C. Pop, Ioana Zelina
2016 J jnl
Design and comparison of two evolutionary approaches for automated product design.
Soft Comput.
Oliviu Matei, Diana Contras, Petrica C. Pop, Honoriu Valean
2016 — conf
Towards a Secure Two-Stage Supply Chain Network: A Transportation-Cost Approach.
SOCO-CISIS-ICEUTE
Camelia-Mihaela Pintea, Anisoara Calinescu, Petrica C. Pop, Cosmin Sabo
2015 Misc conf
A Novel Hybrid Algorithm for Solving the Clustered Vehicle Routing Problem.
HAIS
Andrei Horvat Marc, Levente Fuksz, Petrica C. Pop, Daniela Danciulescu
2015 J jnl
An efficient Reverse Distribution System for solving sustainable supply chain network design problem.
J. Appl. Log.
Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar, Mara Hajdu-Macelaru
2015 J jnl
An improved hybrid algorithm for capacitated fixed-charge transportation problem.
Log. J. IGPL
Camelia-Mihaela Pintea, Petrica C. Pop
2015 J jnl
An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem.
Neurocomputing
Oliviu Matei, Petrica C. Pop, Jozsef Laszlo Sas, Camelia Chira
2014 Misc conf
A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem.
HAIS
Petrica C. Pop, Levente Fuksz, Andrei Horvat Marc
2014 B conf
A hybrid approach based on genetic algorithms for solving the Clustered Vehicle Routing Problem.
IEEE Congress on Evolutionary Computation
Petrica C. Pop, Camelia Chira
2014 — conf
An Ant Algorithm for the Partition Graph Coloring Problem.
NMA
Stefka Fidanova, Petrica C. Pop
2014 B conf
Applying evolutionary computation for evolving ontologies.
IEEE Congress on Evolutionary Computation
Oliviu Matei, Diana Contras, Petrica C. Pop
2014 J jnl
On the complexity of the selective graph coloring problem in some special classes of graphs.
Theor. Comput. Sci.
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
2014 B conf
On the resilience of an ant-based system in fuzzy environments. An empirical study.
FUZZ-IEEE
Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Petrica C. Pop
2013 — conf
A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem.
LION
Petrica C. Pop, Oliviu Matei
2013 Misc conf
A Hybrid Genetic Algorithm with Variable Neighborhood Search Approach to the Number Partitioning Problem.
HAIS
Levente Fuksz, Petrica C. Pop
2013 — conf
A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem.
EUROCAST (1)
Petrica C. Pop, Bin Hu, Günther R. Raidl
2013 J jnl
An improved hybrid algorithm for solving the generalized vehicle routing problem.
Neurocomputing
Petrica C. Pop, Oliviu Matei, Corina Pop Sitar
2013 C conf
Increasing the Antibandwidth of Sparse Matrices by a Genetic Algorithm.
IEA/AIE
Petrica C. Pop, Oliviu Matei
2013 J jnl
Optical character recognition in real environments using neural networks and k-nearest neighbor.
Appl. Intell.
Oliviu Matei, Petrica C. Pop, Honoriu Valean
2013 — conf
Sensitive Ants for Denial Jamming Attack on Wireless Sensor Network.
SOCO-CISIS-ICEUTE
Camelia-Mihaela Pintea, Petrica C. Pop
2013 J jnl
Sensitive Ants for Denial Jamming Attack on Wireless Sensor Network.
CoRR
Camelia-Mihaela Pintea, Petrica C. Pop
2013 J jnl
The Generalized Traveling Salesman Problem solved with Ant Algorithms.
CoRR
Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira
2012 — conf
A Genetic Programming Approach for Solving the Linear Ordering Problem.
HAIS (2)
Petrica C. Pop, Oliviu Matei
2012 — conf
A Hybrid Classical Approach to a Fixed-Charged Transportation Problem.
HAIS (1)
Camelia-Mihaela Pintea, Corina Pop Sitar, Mara Hajdu-Macelaru, Petrica C. Pop
2012 C conf
A Robust Approach to Digit Recognition in Noisy Environments.
IEA/AIE
Oliviu Matei, Petrica C. Pop, Honoriu Valean
2012 — conf
Classical Hybrid Approaches on a Transportation Problem with Gas Emissions Constraints.
SOCO
Camelia-Mihaela Pintea, Petrica C. Pop, Mara Hajdu-Macelaru
2012 J jnl
Classical hybrid approaches on a transportation problem with gas emissions constraints
CoRR
Camelia-Mihaela Pintea, Petrica C. Pop, Mara Hajdu-Macelaru
2012 C conf
Selective Graph Coloring in Some Special Classes of Graphs.
ISCO
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
2012 J jnl
Sensitive Ants in Solving the Generalized Vehicle Routing Problem
CoRR
Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop
2012 — conf
Sensor Networks Security Based on Sensitive Robots Agents: A Conceptual Model.
CISIS/ICEUTE/SOCO Special Sessions
Camelia-Mihaela Pintea, Petrica C. Pop
2012 J jnl
Sensor networks security based on sensitive robots agents. A conceptual model
CoRR
Camelia-Mihaela Pintea, Petrica C. Pop
2011 A conf
A hybrid heuristic approach for solving the generalized traveling salesman problem.
GECCO
Petrica C. Pop, Serban Iordache
2011 — conf
An Efficient Hybrid Soft Computing Approach to the Generalized Vehicle Routing Problem.
SOCO
Petrica C. Pop, Oliviu Matei, Honoriu Valean
2011 — conf
An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming.
HAIS (2)
Petrica C. Pop, Oliviu Matei
2011 J jnl
Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem.
Int. J. Comput. Commun. Control
Petrica C. Pop, Ioana Zelina, Vasile Lupse, Corina Pop Sitar, Camelia Chira
2010 — conf
A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem.
HAIS (2)
Petrica C. Pop, Oliviu Matei, Corina Pop Sitar, Camelia Chira
2010 — conf
A New Approach for Solving the Generalized Traveling Salesman Problem.
Hybrid Metaheuristics
Petrica C. Pop, Oliviu Matei, Cosmin Sabo
2008 Misc conf
A Hybrid Ant-Based System for Gate Assignment Problem.
HAIS
Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira, Dumitru Dumitrescu
2008 B conf
A Sensitive Metaheuristic for Solving a Large Optimization Problem.
SOFSEM
Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop
2007 Misc conf
A Bio-Inspired Approach for a Dynamic Railway Problem.
SYNASC
Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar, Dumitru Dumitrescu
2007 — conf
An Ant-Based Heuristic for the Railway Traveling Salesman Problem.
EvoWorkshops
Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar
2007 C conf
Exact Algorithms for Generalized Combinatorial Optimization Problems.
COCOA
Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu
2007 J jnl
On the prize-collecting generalized minimum spanning tree problem.
Ann. Oper. Res.
Petrica C. Pop
2006 J jnl
A new relaxation method for the generalized minimum spanning tree problem.
Eur. J. Oper. Res.
Petrica C. Pop, Walter Kern, Georg Still
2005 — conf
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size.
ACiD
Petrica C. Pop, Georg Still, Walter Kern
2004 J jnl
New Models of the Generalized Minimum Spanning Tree Problem.
J. Math. Model. Algorithms
Petrica C. Pop
2004 C conf
The Railway Traveling Salesman Problem.
ATMOS
Georgia Hadjicharalambous, Petrica C. Pop, Evangelia Pyrga, George Tsaggouris, Christos D. Zaroliagis
2001 J jnl
Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electron. Notes Discret. Math.
Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle