Petrica Pop
Title
Cited by
Cited by
Year
The generalized minimum spanning tree problem
PC Pop, W Kern, GJ Still
Faculty of Mathematical Sciences, University of Twente, 2000
862000
The generalized minimum spanning tree problem
PC Pop, W Kern, GJ Still
Faculty of Mathematical Sciences, University of Twente, 2000
862000
New mathematical models of the generalized vehicle routing problem and extensions
PC Pop, I Kara, AH Marc
Applied Mathematical Modelling 36 (1), 97-107, 2012
822012
An improved hybrid algorithm for solving the generalized vehicle routing problem
PC Pop, O Matei, CP Sitar
Neurocomputing 109, 76-83, 2013
512013
A new relaxation method for the generalized minimum spanning tree problem
PC Pop, W Kern, G Still
European Journal of Operational Research 170 (3), 900-908, 2006
472006
Heuristic algorithms for solving the generalized vehicle routing problem
PC Pop, I Zelina, V Lupşe, CP Sitar, C Chira
International Journal of Computers Communications & Control 6 (1), 158-165, 2011
442011
Generalized network design problems: Modeling and optimization
PC Pop
Walter de Gruyter, 2012
402012
New models of the generalized minimum spanning tree problem
PC Pop
Journal of Mathematical Modelling and Algorithms 3 (2), 153-166, 2004
382004
A genetic algorithm for solving the generalized vehicle routing problem
PC Pop, O Matei, CP Sitar, C Chira
International Conference on Hybrid Artificial Intelligence Systems, 119-126, 2010
372010
Comparison of wrapper and filter feature selection algorithms on human activity recognition
J Suto, S Oniga, PP Sitar
2016 6th International Conference on Computers Communications and Control …, 2016
362016
An efficient Reverse Distribution System for solving sustainable supply chain network design problem
PC Pop, CM Pintea, CP Sitar, M Hajdu-Măcelaru
Journal of Applied Logic 13 (2), 105-113, 2015
342015
Feature analysis to human activity recognition
J Suto, S Oniga, PP Sitar
International Journal of Computers Communications & Control 12 (1), 116-130, 2016
322016
An efficient genetic algorithm for solving the generalized traveling salesman problem
O Matei, P Pop
Proceedings of the 2010 IEEE 6th International Conference on Intelligent …, 2010
292010
Optical character recognition in real environments using neural networks and k-nearest neighbor
O Matei, PC Pop, H Vălean
Applied intelligence 39 (4), 739-748, 2013
282013
The generalized traveling salesman problem solved with ant algorithms
CM Pintea, PC Pop, C Chira
Journal of Universal Computer Science 13 (7), 1065-1075, 2007
282007
An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem
O Matei, PC Pop, JL Sas, C Chira
Neurocomputing 150, 58-66, 2015
262015
Solving the Generalized Vehicle Routing Problem with an ACS‐based Algorithm
PC Pop, C Pintea, I Zelina, D Dumitrescu
AIP Conference Proceedings 1117 (1), 157-162, 2009
262009
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size
PC Pop, W Kern, GJ Still
Fac. of Applied Mathematics, University of Twente, 2001
252001
On the complexity of the selective graph coloring problem in some special classes of graphs
M Demange, J Monnot, P Pop, B Ries
Theoretical Computer Science 540, 89-102, 2014
242014
A hybrid classical approach to a fixed-charged transportation problem
CM Pintea, CP Sitar, M Hajdu-Macelaru, P Petrica
International Conference on Hybrid Artificial Intelligence Systems, 557-566, 2012
242012
The system can't perform the operation now. Try again later.
Articles 1–20