# Publicatii

**Lista lucrarilor stiintifice publicate in reviste de specialitate din tara si strainatate**

**2020**

137. **P.C. Pop**, The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances, European Journal of Operational Research, Vol. 283(1), pp. 1-15, 2020.

136. O. Cosma, **P.C. Pop** and D. Danciulescu, A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes, Computers and Operations Research, in Press, 2020.

135. G.C. Crisan, C.M. Pintea, **P.C. Pop** and O. Matei, Economical connections between several European countries based on TSP data, Logic Journal of IGPL, Vol. 28(1), pp. 33-44, 2020.

134. O. Cosma, **P.C. Pop** and C. Sabo, A novel hybrid genetic algorithm for the two-stage transportation problem with fixed charges associated to the routes, in Proc. of SOFSEM 2020, Lecture Notes in Computer Science, Vol. 12011, pp. 1-12, 2020.

133. O. Cosma, **P.C. Pop** and I. Zelina, An efficient soft computing approach for solving the two-stage transportation problem with fixed costs, in Proc. of SOCO 2019, Advances in Intelligent Systems and Computing, Vol. 950, pp. 523-532, 2020.

132. A. Vescan, C.M. Pintea and **P.C. Pop**, Solving the test case prioritization problem with secure features using ant colony system, in Proc. of CISIS 2019, Advances in Intelligent Systems and Computing, Vol. 951, pp. 67-76, 2020.

131. A. Avram, O. Matei, C.M. Pintea, **P.C. Pop** and C.A. Anton, Context-aware data mining vs classical data mining: case study on predicting soil moisture, in Proc. of SOCO 2019, Advances in Intelligent Systems and Computing, Vol. 950, pp. 199-208, 2020.

**2019**

130. O. Cosma, **P.C. Pop** and C. Pop Sitar, An efficient iterated local search heuristic algorithm for the two-stage fixed-charge transportation problem, Carpathian Journal of Mathematics, Vol. 35(2), pp. 153-164, 2019.

129. O. Cosma, **P.C. Pop** and D. Danciulescu, On the two-stage transportation problem with fixed charges for opening the distribution centers, IEEE Access, Vol. 7(1), pp. 113684-113698, 2019.

128. C.M. Pintea, A. Calinescu, C. Pop Sitar and **P.C. Pop**, Towards secure & green two-stage supply chain networks, Logic Journal of the IGPL, Vol. 27(2), pp. 137-148, 2019.

127. O. Cosma, **P.C. Pop** and C. Sabo, An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes, in Proc. of ITQM 2019, Procedia Computer Science, Vol. 162, pp. 900-907, 2019.

126. O. Cosma, **P.C. Pop** and C. Sabo, An efficient hybrid genetic algorithm for solving a particular two-stage fixed-charge transportation problem, in Proc. of HAIS 2019, Lecture Notes in Computer Science, Vol. 11734, pp. 157-167, 2019.

125. A. Petrovan, **P.C. Pop** and O. Matei, Haploid versus Diploid genetic algorithms. A comparative study, in Proc. of HAIS 2019, Lecture Notes in Computer Science, Vol. 11734, pp. 193-205, 2019.

124. A. Petrovan, R. Erdei, **P.C. Pop** and O. Matei, A self-adapting immigrational genetic algorithm for solving a real-life application of vehicle routing problem, in Proc. of CoMeSySo, Advances in Intelligent Systems and Computing, Vol. 1047, pp. 144-156, 2019.

123. C.M. Pintea, G.C. Crisan and **P.C. Pop**, Towards secure transportation based on intelligent transport system. Novel approach and concepts, in Proc. of CISIS 2018, Advances in Intelligent Systems and Computing, Vol. 771, pp. 469-477, 2019.

122. C. Sabo, A. Horvat Marc and **P.C. Pop**, Comments on „A two-stage supply chain problem with fixed costs: An ant colony optimization approach” by Hong et al. International Journal of Production Economics (2018), Creative Mathematics and Informatics, Vol. 28(2), pp. 183-189, 2019.

121. C.M. Pintea, B. Iantovics, **P.C. Pop **and M. Dehmer, Escape from solutions stagnation. A study on ant system solving TSP, Creative Mathematics and Informatics, Vol. 28(1), pp. 77-83, 2019.

**2018**

120. **P.C. Pop**, O. Matei, C. Sabo and A. Petrovan, A two-level solution approach for solving the generalized minimum spanning tree problem, European Journal of Operational Research, Vol. 265(2), pp. 478-487, 2018.

119. **P.C. Pop**, L. Fuksz, A. Horvat Marc and C. Sabo, A novel two-level optimization approach for clustered vehicle routing problem, Computers & Industrial Engineering, Vol. 115, pp. 304-318, 2018.

118. A. Horvat Marc, L. Fuksz, **P.C. Pop** and D. Danciulescu, A decomposition-based method for solving the Clustered Vehicle Routing Problem, Logic Journal of IGPL, Vol. 26(1), pp. 83-95, https://doi.org/10.1093/jigpal/jzy037, 2018.

117. **P.C. Pop,** O. Matei and C.M. Pintea, A two-level diploid genetic based algorithm for solving the family traveling salesman problem, in Proc. of GECCO 2018, Association for Computing Machinery, Kyoto, Japan, 2018.

116. O. Cosma, **P.C. Pop**, O. Matei and I. Zelina, A hybrid iterated local search algorithm for solving a particular two-stage fixed-charge transportation problem, in Proc. of HAIS 2018, Oviedo, Spain, 2018.

115. J. Suto, S. Oniga and **P.C. Pop**, Recognition of music stimuli patterns in electroencephalogram (EEG) signals, in Proc. of ICCC 2018, Baile Felix, Romania, 2018.

114. O. Cosma, P.C. Pop and C. Sabo, A novel heuristic approach for solving the two-stage transportation problem with fixed charges associated to the routes, in Proc. of ICMA 2018, Madeira, Portugal, pp. 29-32, 2018.

**2017**

113. **P.C. Pop**, C. Sabo, B. Biesinger, B. Hu and G. Raidl, Solving the two-stage fixed-charge transportation problem with a hybrid genetic algorithm, Carpathian Journal of Mathematics, Vol. 33, No. 3, pp. 365-371,2017.

112. J. Suto, S. Oniga and **P.C. Pop**, Feature analysis to human activity recognition, International Journal of Computers, Communications & Control, Vol. 12, No. 1, pp. 116-130, 2017.

111. C.M. Pintea, **P.C. Pop **and C. Chira, The generalized traveling salesman problem solved with ant algorithms, Complex Adaptive Modelling Systems, Springer, Vol. 5, 8 pages, 2017.

110. **P.C. Pop**, O. Matei and C. Sabo, A hybrid diploid genetic based algorithm for solving the generalized traveling salesman problem, in Proc. of HAIS 2017, Lecture Notes in Computer Science, Vol. 10334, pp. 149-160, 2017.

109. C.-M. Pintea, S.A. Ludwig, **P.C. Pop** and O. Matei, Similarities and Sensitivity: Immune and Ant Algorithms applied towards Robotics, in Proc. of CEC 2017, San Sebastian, Spain, 2017.

108. **P.C. Pop**, O. Matei, C. Pop Sitar and D. Danciulescu, A genetic algorithm based solution approach to solve the prize-collecting generalized minimum spanning tree problem, in Proc. of International Conference on Computers and Industrial Engineering (CIE), 11-13 October, Lisbon, Portugal, code 133146, 2017.

107. C. Sabo, **P.C. Pop**, H. Valean and D. Danciulescu, An innovative approach to manage heterogeneous information using relational database systems, in: Madureira A., Abraham A., Gamboa D., Novais P. (eds) Intelligent Systems Design and Applications. ISDA 2016, Advances in Intelligent Systems and Computing, Springer, Vol. 557, pp. 1-10, 2017.

106. O. Matei, T. Rusu, A. Bozga, C. Anton and **P.C. Pop**, Context-aware data mining: embedding external data sources in a machine learning process, in Proc. of HAIS 2017, Lecture Notes in Computer Science, Vol. 10334, pp. 415-426, 2017.

105. O. Matei, C. Anton, A. Bozga and **P.C. Pop**, Multi-layered architecture for soil moisture prediction in agriculture 4.0, in Proc. of International Conference on Computers and Industrial Engineering (CIE), 11-13 October, Lisbon, Portugal, code 133146, 2017.

**2016**

104. **P.C. Pop**, O. Matei, C. Pop Sitar and I. Zelina, A hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem, Carpathian Journal of Mathematics, Vol. 32, No. 2, pp. 225-232, 2016.

103. S. Fidanova and **P.C. Pop**, An improved hybrid ant-local search for the partition graph coloring problem, Journal of Computational and Applied Mathematics, Vol. 293, pp. 55-61, doi: 10.1016/j.cam.2015.04.030, Elsevier, 2016.

102. C.M. Pintea, **P.C. Pop** and I. Zelina, Denial jamming attacks on wireless sensor network using sensitive agents, Logic Journal of IJPL, doi: 10.1093/jigpal/jzv046, Oxford University Press, Vol. 24(1), pp. 92-103, 2016.

101. O. Matei, D. Contras, **P.C. Pop** and H. Valean, Design and Comparison of Two Evolutionary Approaches for Automated Product Design, Soft Computing*, *Vol. 20, Issue 11, pp 4257-4269, 2016.

100. C.M. Pintea, A. Calinescu, **P.C. Pop** and C. Sabo, Towards a Secure Two-stage Supply Chain Network: A Transportation-Cost Approach, in Proc. of CISIS 2016, Advances in Intelligent Systems and Computing, Vol. 527, pp. 547-554, 2016.

99. G.C. Crisan, C.M. Pintea, **P.C. Pop** and O. Matei, An analysis of the hardness of novel TSP instances, in Proc. of HAIS 2016, Lecture Notes in Computer Science, Vol. 9648, pp. 353-364, 2016.

98. J. Suto, S. Oniga and **P.C. Pop**, Comparison of wrapper and filter feature selection algorithms on human activity recognition, in Proc. of IEEE International Conference on Computers, Communications and Control 2016, pp. 124-129, 2016.

**2015**

97. **P.C. Pop**, C.M. Pintea, C. Pop Sitar and M. Hajdu-Macelaru, An efficient reverse ditribution system for solving a supply chain network design problem, Journal of Applied Logic, Elsevier, Vol. 13(2), Part A, pp. 105-113, 2015.

96. C.M. Pintea and **P.C. Pop**, An improved hybrid algorithm for capacitated fixed-charge transportation problem, Logic Journal of IJPL, doi: 10.1093/jigpal/jzv014, Oxford University Press, Vol. 23(3), pp. 369-378, 2015.

95. O. Matei, **P.C. Pop**, I. Sas and C. Chira, An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem, Neurocomputing, Elsevier, Vol. 150, Part A, pp. 58-66, 2015.

94. S. Fidanova and **P.C. Pop**, An ant algorithm for the partition graph coloring problem, Numerical Methods and Applications, Lecture Notes in Computer Science, Springer, Vol. 8962, pp. 78-84, 2015.

93. A. Horvat Marc, L. Fuksz, **P.C. Pop** and D. Danciulescu, A novel hybrid algorithm for solving the clustered vehicle routing problem, in Proc. of HAIS 2015, Lecture Notes in Artificial Intelligence, Vol. 9121, pp. 679-689, 2015.

**2014**

92. **P.C. Pop**, O. Matei and C.-A. Comes, Reducing the bandwidth of sparse matrix with a genetic algorithm, Optimization, Taylor & Francis, Vol. 63(4), pp. 1851-1876, 2014.

91. M. Demange, J. Monnot, **P.C. Pop** and B. Ries, On the complexity of the selective graph coloring problem in some special classes of graphs, Theoretical Computer Science, Elsevier, Vol. 540-541, pp. 82-102, 2014.

90. **P.C. Pop** and C. Chira, A hybrid approach based on genetic algorithms for solving the clustered vehicle routing problem, in Proc. of IEEE Congress on Evolutionary Computation (CEC-2014), pp. 1421-1426, Beijing, China, 6-11 July, 2014.

89. O. Matei, D. Contras and **P.C. Pop**, Applying evolutionary computation for evolutionary ontologies, in Proc. of IEEE Congress on Evolutionary Computation (CEC-2014), pp. 1520-1527, Beijing, China, 6-11 July, 2014.

88. G.C. Crisan, C. Pintea and **P.C. Pop**, On the resilience of an ant-based system in fuzzy environtments. An empirical study, in Proc. of IEEE Congress on Fuzzy Systems (FUZZ-2014), pp. 2588-2593, Beijing, China, 6-11 July, 2014.

87. **P.C. Pop**, F. Levente and A. Horvat Marc, A Variable Neighborhood Search approach for solving the generalized vehicle routing problem, in Proc. of HAIS 2014, Lecture Notes in Computer Science, Vol. 8480, pp. 13-24, 2014.

86. C.M. Pintea and **P.C. Pop**, Sensitive ants for denial of jamming attack on wireless sensor network, in Proc. of CISIS 2013, Advances in Intelligent Systems and Computing, Springer, Vol. 239, pp. 409-418, 2014.

85. **P.C. Pop** and O. Matei, An efficient metaheuristic approach for solving a class of matrix optimization problems, in Proc. of 15th EU/ME Workshop Metaheuristics and Engineering, pp. 17-25, 2014.**2013**

84. **P.C. Pop** and O. Matei, A memetic algorithm for solving the multidimensional multi-way number partitioning problem, Applied Mathematical Modelling, Elsevier, Vol. 37, Issue 22, pp. 9191-9202, 2013.

83. **P.C. Pop**, O. Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem, Neurocomputing, Elsevier, Vol. 109, pp. 76-83, 2013.

82. O. Matei, **P.C. Pop** and H. Valean, Optical Character Recognition in Real Environments using Neural Networks and k-Nearest Neighbor, Applied Intelligence, Springer, Vol. 39(4), pp. 739-748, 2013.

81. **P.C. Pop**, B. Hu and G.R. Raidl, A memetic algorithm with two distinct solution representations for the partition graph coloring problem, in Proc. of EUROCAST 2013, R. Moreno-Diaz et al. (Eds.), Lecture Notes Computer Science, Springer, Vol. 8111, pp. 219-227, 2013.

80. **P.C. Pop** and O. Matei, A genetic algorithm approach for the multidimensional two-way number partitioning problem, in Proc. of LION 7, G. Nicosia et al. (Eds.), Lecture Notes Computer Science, Springer, Vol. 7997, pp. 81-86, 2013.

79. **P.C. Pop** and O. Matei, Increasing the antibandwidth of sparse matrices by a genetic algorithm, in Proc. of IEA/AIE 2013, M. Ali et al. (Eds.), Lecture Notes in Artificial Intelligence, Springer, Vol. 7906, pp. 242-251, 2013.

78. L. Fuksz and **P.C. Pop**, A hybrid genetic algorithm with variable neighborhood search approach to the number partitioning problem, in Proc. of HAIS 2013, Lecture Notes in Computer Science, Springer, Vol. 8073, pp. 649-658, 2013.

77. S. Oniga and **P.C. Pop**, Application possibilities of hardware implemented hybrid neural networks to support independent life of ederly people, in Proc. of HAIS 2013, Lecture Notes in Computer Science, Springer, Vol. 8073, pp. 520-529, 2013.

76. C.-M. Pintea and **P.C. Pop**, Sensor Networks Security Based on Sensitive Robots Agents: A Conceptual Model, in Proc. of CISIS 2012, Advances in Intelligent Systems and Computing, Springer, Vol. 189, pp. 47-56, 2013.

75. C.-M. Pintea, **P.C. Pop** and M. Hajdu-Macelaru, Classical Hybrid Approaches on a Transportation Problem with Gas Emissions Constraints, in Proc. of SOCO 2012, Advances in Intelligent Systems and Computing, Springer, Vol. 188, pp. 449-458, 2013.

74. L. Fuksz , **P.C. Pop** and I. Zelina, Heuristic algorithms for solving the bi-dimensional two-way number partitioning problem, Studia Universitatis Babes-Bolyai, Series Informatica, Vol. LVIII, No. 3, pp. 17-28, 2013.

73. **P.C. Pop**, B. Hu and G.R. Raidl, A memetic algorithm for the partition coloring problem. In: Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pp. 167-169, Gran Canaria, Spain, 2013.**2012**

72. **P.C. Pop**, I. Kara and A. Horvat Marc, New Mathematical Models of the Generalized Vehicle Routing Problem and Extensions, Applied Mathematical Modelling, Elsevier, Vol. 36, Issue 1, pp. 97-107, 2012.

71. **P.C. Pop** and O. Matei, A Genetic Programming Approach for Solving the Linear Ordering Problem, in Proc. of HAIS 2012, Part II, Editors E. Corchado et al., Lecture Notes in Computer Science, Springer, Vol. 7209, pp. 331-338, 2012.

70. **P.C. Pop** and C. Pop Sitar, New Models of the Generalized Fixed-Charge Network Design Problem, Carpathian Journal of Mathematics, Vol. 28, No.1, pp. 143-150, 2012.

69. M. Demange, J. Monnot, **P.C. Pop** and B. Reis, Selective Graph Coloring in Some Special Classes of Graphs, in Proc. of ISCO 2012, Lecture Notes in Computer Science, Vol. 7422, pp. 320-331, Springer, 2012.

68. C. Pintea, C. Pop Sitar, M. Hajdu-Macelaru and **P.C. Pop**, A Hybrid Classical Approach to a Fixed-Charge Transportation Problem, in Proc. of HAIS 2012, Part I, Editors E. Corchado et al., Lecture Notes in Computer Science, Springer, Vol. 7208, pp. 557-566, 2012.

67. O. Matei, **P.C. Pop** and H. Valean, A Robust Approach to Digit Recognition in Noisy Environments, in Proc. of IEA/AIE 2012, H. Jiang et al. (Eds.), Lecture Notes in Artificial Intelligence, Springer, Vol. 7347, pp. 606-615, 2012.

66. **P.C. Pop** and A. Horvat Marc, Local Search Heuristics for the Generalized Vehicle Routing Problem, in Proc. of ICSMO 2012, IACSIT Press, Vol. 23, pp. 84-88, 2012.

**2011**

65. **P.C. Pop**, C. Pop Sitar, I. Zelina, V. Lupse and C. Chira, Heuristic algorithms for solving the generalized vehicle routing problem, International Journal of Computers, Communications & Control, Vol. 6, No. 1, pp. 158-166, 2011.

64. **P.C. Pop** and C. Pop Sitar, A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem, Yugoslav Journal of Operations Research, Vol. 21, No. 2, pp. 187-198, 2011. [ Details ]

63. **P.C. Pop** and S. Iordache, A Hybrid Heuristic Approach for Solving the Generalized Traveling Saleasman Problem, in Proc. of GECCO 2011, Association for Computing Machinery, pp. 481-488, 2011, ISBN: 978-1-4503-0557-0.

62. **P.C. Pop** and O. Matei, An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming, in Proc. of HAIS 2011, Part II, Editors E.S. Corchado Rodriguez et al., Lecture Notes in Artificial Intelligence, Springer, Vol. 6079, pp. 67-74, 2011.

61. **P.C. Pop**, O. Matei and H. Valean, An Efficient Soft Computing Approach to the Generalized Vehicle Routing Problem, Advances in Intelligent and Soft Computing, Springer, Vol. 87, pp. 281-289, 2011.

60. **P.C. Pop**, O. Matei and C. Sabo, A Memetic Algorithm for Solving the Generalized Minimum Spanning Tree Problem, Advances in Intelligent and Soft Computing, Springer, Vol. 96, pp. 187-194, 2011.

59. **P.C. Pop**, O. Matei, E. Burzu and C. Gyorodi, A Computational Analysis of Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem, Journal of Computers and Control Systems, Vol. 4, No. 1, pp. 143-149, 2011.

58. C. Pintea, C. Chira, D. Dumitrescu and **P.C. Pop**, Sensitive ants in solving the generalized vehicle routing problem, International Journal of Computers, Communications & Control, Vol. 6, No. 4, pp. 734-741, 2011.

57. S. Iordache and **P.C. Pop**, An Efficient Algorithm for the Generalized Traveling Salesman Problem, in Proc. of 13-th Int. Conf. on Computer Aided Systems Theory (EUROCAST 2011), Editors A. Quesada-Arencibia et al., pp. 264-267, 2011, ISBN: 978-84-693-9560-8.

**2010**

56. **P.C. Pop**, O. Matei and C. Sabo, A New Approach for Solving the Generalized Traveling Salesman Problem, in Proc. of HM 2010, Editors M.J. Blesa et al., Lecture Notes in Computer Science, Springer, Vol. 6373, pp. 62-72, 2010.

55. **P.C. Pop**, O. Matei, C. Pop Sitar and C. Chira, A genetic algorithm for solving the generalized vehicle routing problem, in Proc. of HAIS 2010, Part II, Editors E.S. Corchado Rodriguez et al., Lecture Notes in Artificial Intelligence, Springer, Vol. 6077, pp. 119-126, 2010. [pdf]

54. O. Matei and **P.C. Pop**, An efficient genetic algorithm for solving the generalized traveling salesman problem, in Proc. of 6-th IEEE International Conference on Intelligent Computer Communication and Processing, pp. 87-92, 2010.

53. **P.C. Pop**, On the Generalized Network Design Problems, Carpathian Journal of Electronic and Computer Engineering, Vol. 3, No. 1, pp. 103-107, 2010.**2009**

52. P.C. Pop, A survey of different integer programming formulations of the generalized minimum spanning tree problem, Carpathian Journal of Mathematics, Vol. 25, No. 1, pp. 104-118, 2009. [pdf]

51. P.C. Pop, C.M. Pintea, I. Zelina and D. Dumitrescu, Solving the Generalized Vehicle Routing Problem with an ACS-based Algorithm, American Institute of Physics, Vol. 1117, pp. 157-162, 2009, (Conf. Proc. BICS Tg. Mures 5-7 November 2008). [pdf]

50. P.C. Pop, Efficient Transformations of the Generalized Combinatorial Optimization Problems into Classical Variants, 9-th Balkan Conference on Operational Research BALCOR 2009, 2-6 September, Constanta, Romania.

49. P.C. Pop, C. Pop Sitar, A. Horvat Marc and I. Zelina, A local-global approach to the Generalized Minimum Spanning Tree Problem, Analele Universitatii din Timisoara, seria Matematica-Informatica, Fasc. 2, Vol. XLVII, pp. 117-126, 2009.

48. P.C. Pop, C. Pintea and D. Dumitrescu, An Ant Colony Algorithm for Solving the Dynamic Generalized Vehicle Routing Problem, Proc. of 5th International Conference 2009 – Dynamical Systems and Applications, June 15-18, Constanta, Romania, Ovidius University Annals Series: Civil Engineering, Vol.1 (11), pp. 373-382, 2009.

47. N. Pop, L. Vladareanu and P.C. Pop, Finite Element Analysis of Quasistatic Frictional Contact Problems with an Incremental-Iterative Algorithm, Advanced Applications of Electrical Engineering, Proc. of the 8-th International Conference on Applications of Electrical Engineering, pp. 173-178, Houston, USA, April 30 – May 2, 2009.

46. A. Horvat Marc and P.C. Pop, Localization of positive solutions via nonnegative concave functionals, Proc. of the 13-th International Conference on Computers, pp. 175-178, Rhodos, Greece, July 23-25, 2009.

**2008**

45. C.M. Pintea, D. Dumitrescu and P.C. Pop, Combining heuristics and modifying local information to guide ant-based search, Carpathian Journal of Mathematics, Vol. 24, No. 1, pp. 94-103, 2008.

44. P.C. Pop, C.D. Zaroliagis and G. Hadjicharalambous, A cutting plane approach to solve the railway traveling salesman problem, Studia Univ. “Babes–Bolyai”, Mathematica, Volume LIII, Number 1, pp. 63-73, March 2008.

43. C.M. Pintea, P. C. Pop, Camelia Chira, D. Dumitrescu, A Hybrid Ant-based System for Gate Assignment Problem, in Proceedings of the 3-rd International Workshop on Hybrid Artificial Intelligence Systems, Burgos, Spain, Lecture Notes in Computer Science, Vol. 5271, pp. 273-280, 2008. [pdf]

42. Camelia-M. Pintea, Camelia Chira, D. Dumitrescu, and Petrica C. Pop, A Sensitive Metaheuristic for Solving a Large Optimization Problem, in Proceedings of the SOFSEM Conference, Nový Smokovec, High Tatras, Slovakia, Lecture Notes in Computer Science, Vol. 4910, pp. 551-559, 2008. [pdf]

41. I. Zelina, G. Moldovan and P.C. Pop, Some Communication Aspects in Extended Fibonacci Cubes, IEEE Proceedings of International Symposium on Applications and the Internet, pp. 245-248, IEEE Computer Society Press, Turku, Finland, July 28 – August 1, 2008. [pdf]

40. P.C. Pop, C.M. Pintea, I. Zelina and D. Dumitrescu, Solving the Generalized Vehicle Routing Problem with an ACS-based Algorithm, In Proceedings of the Bio-Inspired Computational Methods Used for Difficult Problems Solving. Development of Intelligent and Complex Systems, pp. 156-161, Romanian Academy, Bucharest and Petru Maior University Tg. Mures 5-7 November 2008, Ed. Universitatii Petru Maior, ISSN 2065-0418.

39. Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu, On the generalized minimum spanning tree problem (extended abstract), International Symposium on Combinatorial Optimization, Coventry, UK, pp. 65-67, 2008.

38. Petrica C. Pop, A Strong Integer Programming Formulation of the Generalized Traveling Salesman Problem, (extended abstract), International Symposium on Combinatorial Optimization, Coventry, UK, pp. 67-69, 2008.**2007**

37. P.C. Pop, On the Prize-Collecting Generalized Minimum Spanning Tree Problem, Annals of Operations Research, Vol. 150, No. 1, pp. 193-204, 2007. [pdf]

36. P.C. Pop, New integer programming formulations of the generalized traveling salesman problem, American Journal of Applied Sciences, Vol. 4(11), pp. 932-937, 2007. [pdf]

35. C. Pintea, P.C Pop and C. Chira, The Generalized Traveling Salesman Problem Solved with Ant Algorithms, Journal of Universal Computer Science, vol. 13, No. 7, pp. 1065-1075, 2007.

34. P. Pop, C. Pop Sitar, I. Zelina and I. Tascu, Exact algorithms for generalized combinatorial optimization problems, in Proceedings of the COCOA Conference, Xi’an, China, Lecture Notes in Computer Science, Vol. 4616, pp. 154-162, 2007. [pdf]

33. Petrica Pop, Camelia Pintea and Corina Pop Sitar, An Ant colony based approach to the Railway Travelling Salesman Problem, in Proceedings of the Evo Conference, Valencia, Spain, Lecture Notes in Computer Science, Vol. 4448, pp. 702-711, 2007. [pdf]

32. G. Hadjicharalambous, P.C. Pop, E. Pyrga, G. Tsaggouris and C.D. Zaroliagis, The Railway Travelling Salesman Problem, in Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, Vol. 4359, pp. 264-275, 2007. [pdf]

31. P.C. Pop, C. Pintea, C. Pop Sitar and D. Dumitrescu, A Bio-Inspired Approach for a Dynamic Railway Problem, IEEE Proceedings of the 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 449-453, IEEE Computer Society Press, Timisoara, Romania, September 26-29, 2007. [pdf]

30. Petrica Pop, Corina Pop Sitar, Nicolae Pop and Ioana Zelina, A Local-global Approach to Generalized Network Design Problems, WSEAS Transactions on Computer Research, Issue 2, Vol. 2, pp. 220-227, 2007.

29. Petrica Pop, Cosmin Sabo, Corina Pop Sitar and Marian Craciun, A Simulated Annealing Based Approach for Solving the Generalized Minimum Spanning Tree Problem, Creative Mathematics and Informatics, Vol. 16, pp. 42-53, 2007.

28. Camelia M. Pintea, Petrica C. Pop, D. Dumitrescu, An Ant-based Technique for the Dynamic Generalized Traveling Salesman Problem, 7th WSEAS International Conference on SYSTEMS THEORY AND SCIENTIFIC COMPUTATION, Athens, Greece, pp. 255-259, 2007.

27. Petrica Pop, Corina Pop Sitar, Nicolae Pop and Ioana Zelina, A New Approach to Generalized Network Design Problems, in Proceedings of 6th WSEAS International Conference, Corfu, Greece, pp. 1-5, 2007.

26. Ioana Zelina, Petrica Pop, Corina Pop Sitar and Ioana Tascu, A parallel algorithm for Interpolation in Pancake Graph, in Proceedings of 6th WSEAS International Conference, Corfu, Greece, pp. 98-101, 2007.

25. N. Pop and P.C. Pop, Numerical approximation of the contact problems in elasticity with mixed finite element problem, in Proc. of 6-th International Conference APLIMAT, pp. 285-287, Bratislava, 6-9 February 2007.**2006**

24. P.C. Pop, W. Kern and G. Still, A New Relaxation Method for the Generalized Minimum Spanning Tree Problem, European Journal of Operational Research, 170, pp. 900-908, 2006. [pdf]

23. P.C. Pop, A. Horvat Marc and C. Pop Sitar, An Approximation Algorithm for the At Least version of the Generalized Minimum Spanning Tree Problem, Revue d’Analyse Numerique et de Theorie de l’Approximation, Tome 35, No. 1, pp. 95-103, 2006.

22. P.C. Pop, A Lagrangian Relaxation Approach to the Generalized Minimum Spanning Tree Problem, Mathematica, Tome 48(71), No. 2, pp. 191-201, 2006.

21. P.C. Pop, A. Horvat Marc and C. Pop Sitar, The At Least version of the Generalized Minimum Spanning Tree Problem, Carpathian Journal of Mathematics, Vol. 22, No. 1-2, pp. 129-135, 2006.

20. Camelia Pintea, Petrica Pop and Camelia Chira, Reinforcing Ant Colony System for the Generalized Traveling Salesman Problem, Proceedings of International Conference Bio-Inspired Computing-Theory and Applications (BIC-TA), Wuhan, China, Vol. Evolutionary Computing Section, pp. 245-252, 2006.**2005**

19. P.C. Pop, Approximation Theory in Combinatorial Optimization. Application to the Generalized Minimum Spanning Tree Problem, Revue d’Analyse Numerique et Approximation, Tome 34, No. 1, pp. 93-102, 2005.

18. P.C. Pop and G. Still, An easy way to obtain strong duality results in linear semidefinite and linear semiinfinite programming, Mathematica, Tome 47(70), No. 1, pp. 105-112, 2005.

17. P.C. Pop, On some polynomial solvable cases of the generalized minimum spanning tree problem, Acta Universitatis Apulensis, No. 10, pp. 189-195, 2005.

16. P.C. Pop, W. Kern and G. Still, An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with bounded cluster size, Proceedings of First ACiD Conference, Text in Algorithms 4, King’s College Publications, pp. 115-122, 2005.

**2004**

15. P.C. Pop, New Models of the Generalized Minimum Spanning Tree Problem, Journal of Mathematical Modelling and Algorithms, Vol. 3, Issue 2, pp. 153-166, 2004.

14. P.C. Pop and C. Pop Sitar, A note on the complexity of the Generalized Minimum Spanning Tree Problem, Studia Universitatis Babes-Bolyai, Series Informatics, Volume XLIX, Number 2, pp. 75-80, 2004.

13. P.C. Pop, C. Pop Sitar and I. Zelina, Efficient Algorithms for the Generalized Minimum Spanning Tree Problem, in Proceedings of 4-th International Conference on Applied Mathematics, Baia Mare, Romania, 23-26 September, Carpathian Journal of Mathematics, Vol. 20, No. 1, pp. 109-117, 2004.

12. P.C. Pop and I. Zelina, Heuristic Methods for the Generalized Minimum Spanning Tree Problem, in Proceedings of International Conference on Theory and Applications of Mathematics and Informatics, Thessaloniki, Greece, 16-18 September, Acta Universitatis Apulensis, No. 8, pp. 385-396, 2004.

**2003**

11. P.C. Pop, A New Method for Solving the Generalized Minimum Spanning Tree Problem, in Proceedings of European Conference on Graph Theory, Combinatorics and Applications, Prague, Czech Republic, 8-12 September, pp. 313-317, 2003.**2002**

10. P.C. Pop, Approximation Results for the Generalized Minimum Spanning Tree Problem, Proceedings of the 3rd International Conference on Applied Mathematics, North University of Baia Mare, Borsa, Romania, 10-13 October, pp. 95-104, 2002.**2001**

9. P.C. Pop, W. Kern and G. Still, Relaxation Methods for the Generalized Minimum Spanning Tree Problem, Electronic Notes in Discrete Mathematics, Vol. 8, pp. 76-79, 2001.

8. P.C. Pop, The Generalized Minimum Spanning Tree Polytope and Related Polytopes, Memorandum No. 1587, University of Twente, the Netherlands, 2001.

7. P.C. Pop, W. Kern and G. Still, An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with bounded cluster size, Memorandum, No. 1577, University of Twente, the Netherlands, 2001.

6. P.C. Pop, W. Kern and G. Still, Relaxation Methods for the Generalized Minimum Spanning Tree Problem, 1st Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Cologne, Cologne, Germany, 6-8 June, 2001.

**2000**

5. P.C. Pop, W. Kern and G. Still, The Generalized Minimum Spanning Tree Problem, Memorandum, No. 1542, University of Twente, the Netherlands, 2000.

4. P.C. Pop, Polyhedral aspects and optimality of the generalized minimum spanning tree problem, Scientific Revue of the North University of Baia Mare, Vol. XVI. No. 1, 2000.

3. P.C. Pop, The Generalized Minimum Spanning Tree Problem, Proceedings of the 17th International Symposium on Mathematical Programming, Atlanta, Georgia, USA, 7-11 August, 2000.

**1999**

2. P.C. Pop and G. Still, An easy way to obtain strong duality results in linear, linear semidefinite and linear semiinfinite programming, Memorandum No. 1493, University of Twente, the Netherlands, 1999.**1997**

1. P.C. Pop, Optimal Maintenance of a Machine, Scientific Revue of the North University of Baia Mare, vol. XIII, pp. 131-138, 1997.

**Carti in edituri recunoscute**

P.C. Pop, The Generalized Minimum Spanning Tree Problem, PhD thesis, Twente University Press, Enschede, the Netherlands, 2002.

P.C. Pop, Cercetari Operationale, Editura RisoPrint, 2005.

P.C. Pop, Modelare si Programare Matematica. Teorie si Aplicatii, Editura Universitatii de Nord Baia Mare, 2009.

P.C. Pop, Generalized Network Design Problems. Modeling and Optimization, De Gruyter Series in Discrete Mathematics and Applications, Germany, 2012 (to appear).