Követés
Petrica Pop
Cím
Hivatkozott rá
Hivatkozott rá
Év
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
1262012
A comprehensive survey on the generalized traveling salesman problem
PC Pop, O Cosma, C Sabo, CP Sitar
European Journal of Operational Research 314 (3), 819-835, 2024
1002024
The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances
PC Pop
European Journal of Operational Research 283 (1), 1-15, 2020
992020
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
982016
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
982011
The generalized minimum spanning tree problem
PC Pop
972002
The generalized traveling salesman problem solved with ant algorithms
CM Pintea, PC Pop, C Chira
Complex Adaptive Systems Modeling 5 (1), 8, 2017
802017
An improved hybrid algorithm for solving the generalized vehicle routing problem
PC Pop, O Matei, CP Sitar
Neurocomputing 109, 76-83, 2013
802013
Generalized network design problems: Modeling and optimization
PC Pop
Walter de Gruyter, 2012
702012
Feature analysis to human activity recognition
J Suto, S Oniga, PP Sitar
International Journal of Computers Communications & Control 12 (1), 116-130, 2017
682017
A novel two-level optimization approach for clustered vehicle routing problem
PC Pop, L Fuksz, AH Marc, C Sabo
Computers & Industrial Engineering 115, 304-318, 2018
662018
A two-level solution approach for solving the generalized minimum spanning tree problem
PC Pop, O Matei, C Sabo, A Petrovan
European Journal of Operational Research 265 (2), 478-487, 2018
542018
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
532006
An improved hybrid ant-local search algorithm for the partition graph coloring problem
S Fidanova, P Pop
Journal of computational and applied mathematics 293, 55-61, 2016
492016
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
482015
New integer programming formulations of the generalized traveling salesman problem
PC Pop
American Journal of Applied Sciences 4 (11), 932-937, 2007
462007
Optical character recognition in real environments using neural networks and k-nearest neighbor
O Matei, PC Pop, H Vălean
Applied intelligence 39, 739-748, 2013
452013
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
452010
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
452010
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
432014
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20