Prestigiu Profesional

400 CITARI ALE PUBLICATIILOR STIINTIFICE

107 CITARI IN REVISTE COTATE ISI

  • M. Leitner, Layered graph models and exact algorithms for the Generalized Hop-Constrained Minimum Spanning Tree Problem, Computers & Operations Research, Vol. 65, pp. 1-18, 2016.

Citeaza:

  1. 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 (3), pp. 900-908, 2006.
  2. P.C. Pop, The generalized minimum spanning tree problem, Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • A.R. KhudaBukhsh, L. Xu, H.H. Hoss and K. Leyton-Brown, SATenstein: Automatically building local search SAT solvers from components, Artificial Intelligence, Vol. 232, pp. 20-42, 2016.

Citeaza:

  1. P.C. Pop and S. Iordache, A hybrid heuristic approach for solving the Generalized Traveling Salesman Problem, in Proc. of GECCO 2011, pp. 481-488, 2011.
  • C. Contreras-Bolton, G. Gatica, C.R. Barra and V. Parada, A multi-operator genetic algorithm for the generalized minimum spanning tree problem, Expert Systems with Applications, in Press, 2015.

Citeaza:

  1. P.C. Pop, A survey of different integer programming formulations of the generalized minimum spanning tree problem, Carpathian Journal of Mathematics, 25 (1), pp. 104-118, 2009.
  • K. Braekers, K. Ramaekers and I. van Nieuwenhuyse, Vehicle routing problem: state of the art classification and review, Computers & Industrial Engineering, in Press, 2015.

Citeaza:

  1. P.C. Pop, O.Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem,Neurocomputing, Vol. 109, pp. 76-83, 2013.
  • J. Diaz-Escobar, V.I. Kober and V.N. Karnaukhov, Character recognition in degraded document images using morphological and phase-only filtering, Journal of Communications Technology and  Electronics, Vol. 60(12), pp. 1360-1365, 2015.

Citeaza:

  1. O.Matei ,P.C. Pop and H. Valean, Optical character recognition in real environments using neural networks and k-Nearest Neighbor,Applied Intelligence, Vol. 39(4), pp. 739-748, 2013.
  • J. Mahmoudimehr and L. Loghmani, Optimal management of solar power plant equipped with a termal energy storage system by using dynamic programming method, Journal of Power and Energy, in Press, 2015.

Citeaza:

  1. P.C. Pop, Generalized Network Design Problems: Modelling and Optimization, De Gruyter, 2012.
  • C. Exposito-Izquierdo, A. Rossi and M. Sevaux, A two-level solution approach to solve the clustered capacitated vehicle routing problem, Computers & Industrial Engineering, in Press, 2015.

Citeaza:

  1. P.C. Pop, O.Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem,Neurocomputing, Vol. 109, pp. 76-83, 2013.
  • M. Demange, T. Ekim and B. Ries, On the minimum and maximum selective graph coloring problems in some graph classes, Discrete Applied Mathematics, in Press, 2015.

Citeaza:

  1. 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, Vol. 540-541, pp. 89-102, 2014.
  • R.-M. Chen and Y.-M. Shen, Novel encoding and routing balance insertion based particle swarm optimization with application to optimal CVRP depot location determination, Mathematical Problems in Engineering, Article ID 743507, 2015.

Citeaza:

  1. P.C. Pop, O.Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem, Neurocomputing, Vol. 109, pp. 76-83, 2013.
  • C. Pintea, A unifying survey of agent-based approaches for Equality – Generalized Traveling Salesman Problem, Informatica, Vol. 26, No. 3, pp. 509-522, 2015.

Citeaza:

  1. P.C. Pop, New integer programming formulations for the generalized traveling salesman problem, American Journal of Applied Sciences, Vol. 4, 932-937, 2007.
  2. P.C. Pop and I. Zelina, Heuristic algorithms for the generalized minimum spanning tree problem, Acta Universitatis Apulensis, Vol. 8, pp. 385-395, 2004.
  3. P.C. Pop, C. Pintea, I. Zelina and D. Dumitrescu, Solving the generalized vehicle touting problem with ACS-based algorithm, American Institute of Physisc, Vol. 1117, pp. 157-162, 2009.
  4. C. Pintea, P.C. Pop and C. Chira, Reinforcing ant colony system for the generalized traveling salesman problem, in Proc. of BIC-TA, pp. 245-252, 2006.
  5. C. Pintea, C. Chira, D. Dumitrescu and P.C. Pop, A sensitive metaheuristic for solving a large optiomization problem, in Proc. of SOFSEM, Lecture Notes in Computer Science, Vol. 4910, pp. 551-559, 2008.
  6. C. Pintea, C. Chira, D. Dumitrescu and P.C. Pop, Sensitive ants for solving the generalized vehicle routing problem, International Journal of Computers, Control and Communications, Vol. 6(4), pp. 731-738, 2011.
  • K. Abdelkader, Z. Toufik and B.-j. Mohamed, Torsional stress in non-circular cross sections by the finite element method, Advances in Mechanical Engineering, Vol. 7(5), pp. 1-20, 2015.

Citeaza:

  1. P.C. Pop, O. Matei and C-.A. Comes, Reducing the bandwidth of sparse matrix with a genetic algorithm, Optimization, Vol. 63(4), pp. 1851-1876, 2014.
  • D. Alvarez, R. Fernandez and L. Sanchez, Stroke-based intelligent character recognition using a determinist finite automaton, Logic Journal of IGPL, in Press, doi: 10.1093/jigpal/jzv017.

Citeaza:

  1. O. Matei, P.C. Pop and H. Valean, Optical character recognition in real environments using neural networks and k-Nearest Neighbor,Applied Intelligence, Vol. 39(4), pp. 739-748, 2013.
  2. O. Matei, P.C. Pop and H. Valean, A robust approach to digit recognition in noisy environments, in Proc. of IEA/AIE 2012, Lecture Notes in Artificial Intelligence, Vol. 7347, pp. 606-615, 2012.
  • D. Corus, P.K. Lehre and F. Neumann, A parametrized complexity analysis of bi-level optimization with evolutionary algorithms, Evolutionary Computation, in Press, 2015

Citeaza:

  1. P.C. Pop, New models of the generalized minimum spanning tree problem, Journal of Mathematical Modelling and Algorithms, 3 (2), pp. 153-166, 2004.
  • D. Catanzaro, R. Aringhieri, M. di Summa and R. Pesenti, A Branch-Price-and-Cut Algorithm for the Minimum Evolution Problem, European Journal of Operational Research, in Press, 2015.

Citeaza:

  1. P.C. Pop, Generalized Network Design Problems: Modelling and Optimization, De Gruyter, 2012.
  • M. Grana and B. Raducanu, Bioinspired and knowledge based techniques and applications, Neurocomputing, Vol. 150, Part A, pp. 1-3, 2015.

Citeaza:

  1. 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, Vol. 150, Part A, pp. 58-66, 2015.
  • T. Vidal, M. Battarra, A. Subramanian and G. Erdogan, Hybrid metaheuristics for the clustered vehicle routing problem, Computers & Operations Research, Elsevier, Vol. 58, pp. 87-99, 2015.

Citeaza:

  1. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  2. P.C. Pop, O.Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem, Neurocomputing, Vol. 109, pp. 76-83, 2013.
  • A.K. Beheshti and S.R. Hejazi, A novel hybrid column generation-metaheuristic approach for the vehicle routing problem with general soft time window, Information Sciences, Elsevier, in Press, 2014.

Citeaza:

  1. P.C. Pop, O. Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem, Neurocomputing, Vol. 109, pp. 76-83, 2013.
  • A. Andreica and C. Chira, Best-order crossover for permutation-based evolutionary algorithms, Applied Intelligence, Springer, in Press, 2014.

Citeaza:

  1. P.C. Pop, O.Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem, Neurocomputing, Vol. 109, pp. 76-83, 2013.
  • Y. Chung, J.-F. Culus and M. Demange, Inverse chromatic number problems in interval and permutation graphs, European Journal of Operational Research, in Press, 2014.

Citeaza:

  1. 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, Vol. 540-541, pp. 89-102, 2014.
  • L. Kota and K. Jarmai, Mathematical modeling of multiple tour multiplew Traveling Salesman Problem using Evolutionary Programming, Applied Mathematical Modelling, in Press, 2014.

Citeaza:

  1. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  • J. Ceberio, A. Mendiburu and J.A. Lozano, The Linear Ordering Problem Revisited, European Journal of Operational Research, Vol. 241, No. 3, pp. 686-696, 2015.

Citeaza:

  1. P.C. Pop and O. Matei, A Genetic Programming Approach for Solving the Linear Ordering Problem, in Proc. of HAIS 2012, Lecture Notes in Computer Science, Vol. 7209, pp. 331-338, 2012.
  • D. Oliva, E. Cuevas, G. Pajares and D. Zaldivar, Template matching using an improved electromagnetism-like algorithm, Applied Intelligenge, Vol. 43, No. 3, pp. 791-807, 2014.

Citeaza:

  1. O. Matei, P.C. Pop and H. Valean, Optical character recognition in real environments using neural networks and k-Nearest Neighbor,Applied Intelligence, Vol. 39(4), pp. 739-748, 2013.
  • M. Demange, T. Ekim, B. Ries and C. Tanasescu, On some applications of the selective graph coloring problem, European Journal of Operational Research, Vol. 240, Issue 2, pp. 307-314, 2015.

Citeaza:

  1. 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, Vol. 540-541, pp. 89-102, 2014.
  • L. Wang, M. Ni, Z. Yu and L. Zhu, Power geometric operators of hesitant multiplicative fuzzy numbers and their application to multiple attribute group decision making, Mathematical Problems in Engineering, Vol. 2014, article ID 186502, 16 pages, 2014.

Citeaza:

  1. C.M. Pintea, C. Pop Sitar, M. Hajdu-Macelaru and P.C. Pop, A hybrid classical approach to a fixed-charged transportation problem,Lecture Notes in Computer Science, Vol. 7208, pp. 557-566, 2012.
  • H. Ebara, Y. Hiranuma and K. Nakayama, Consultant-guided search for Traveling Salesperson Problem, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E97-A, No. 8, pp. 1728-1738, 2014.

Citeaza:

  1. P.C. Pop and S. Iordache, A hybrid heuristic approach for solving the Generalized Traveling Salesman Problem, in Proc. of GECCO 2011, pp. 481-488, 2011.
  • Y. Lin, J. Li, M. Lin and J. Chen, A new nearest neighbor classifier via fusing neighborhood information, Neurocomputing, Vol. 143, pp. 164-169, 2014.

Citeaza:

  1. O. Matei, P.C. Pop and H. Valean, Optical character recognition in real environments using neural networks and k-Nearest Neighbor,Applied Intelligence, Vol. 39(4), pp. 739-748, 2013.
  • M. Chen, X. Li and K. Tank, Optimal air-move path generation based on MMAS algorithm, International Journal of Production Research, Vol. 52, Issue 24, pp. 7310-7323, 2014.

Citeaza:

  1. 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.
  2. O. Matei and P.C. Pop, An efficient genetic algorithm for solving the generalized traveling salesman person, , in Proc. of 6-th IEEE Int. Conf. on Intelligent Computer Communication and Processing, pp. 87-92, 2010.
  • S. Krichen, S. Faiz, T. Tlili and K. Tej, Tabu-based GIS for solving the vehicle routing problem, Expert Systems with Applications, Vol. 41, Issue 14, pp. 6483-6493, 2014.

Citeaza:

  1. P.C. Pop, O.Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem, Neurocomputing, Vol. 109, pp. 76-83, 2013.
  2. P.C. Pop, O.Matei and H. Valean, An efficient hybrid soft computing approach to the generalized vehicle routing problem, Advances in Inteligent and Soft Computing, Vol. 87, pp.281-289, 2011.
  • M. Yousefikhoshbakht, F. Didehvar and F. Rahmati, An efficient solution for VRP by using a hybrid elite ant system, International Journal of Computers, Communications & Control, Vol. 9, No. 3, pp. 340-347, 2014.

Citeaza:

  1. 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 and Control, Vol. 6, pp. 158-165, 2011.
  2. 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.
  • M. Battarra, G. Erdogan and D.Vigo, Exact algorithms for the Clustered Vehicle Routing Problem, Operations Research, Vol. 62(1), pp. 58-71, 2014.

Citeaza:

  1. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  • J. Kratica, J. Kojic and A. Savic, Two metaheuristics approaches for solving multidimensional two-way number partitioning problem, Computers & Operations Research, Vol. 46, pp. 59-68, 2014.

Citeaza:

  1. 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.
  • Y. Xu and L. Wang, K-nearest neighbor-based weighted twin support vector regression, Applied Intelligence, Vol. 41, Issue 1, pp. 299-309, 2014.

Citeaza:

  1. O. Matei, P.C. Pop and H. Valean, Optical character recognition in real environments using neural networks and k-Nearest Neighbor, Applied Intelligence, Vol. 39(4), pp. 739-748, 2013.
  • R.S. Ferreira, C.L.T. Borges and M.V.T. Pereira, A flexible mixed integer linear programming approach to the AC optimal power flow in distribution systems, IEEE Transactions on Power Systems, Vol. 29, Issue 5, pp. 2447-2459, 2014.

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • C. Chira, J. Sedano, J.R. Villar, M. Camara and E. Corchado, Urban Bicycles Renting System: Modelling and Optimization using Nature-inspired Search Methods, Neurocomputing, Vol. 135, pp. 98-106, 2014.

Citeaza:

  1. P.C. Pop, O. Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing, Vol. 109, pp. 76-83, 2013.
  • M. Landete and A. Marin, Looking for edge-equitable spanning trees, Computers & Operations Research, Vol. 41, pp. 932-937, 2014.

Citeaza:

  1. P.C. Pop, New integer programming formulations of the generalized traveling salesman problem. American Journal of Applied Sciences, Vol. 4, pp. 932-937, 2007.
  • M.H. Ha, N. Bostel, A. Langevin and L.-M. Rousseau, An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size, Computers & Operations Research, Vol. 43, pp. 9-19, 2014.

Citeaza:

  1. 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, Lecture Notes in Artificial Intelligence, Vol. 6077, pp. 119-126, 2010.
  2. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  3. 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.
  • G. Bergantinos, M. Gomez-Rua, N. Llorca, M. Pulido and J. Sanchez-Soriano, A new rule for source connection problem, European Journal of Operational Research, Vol. 234(1), pp. 780-788, 2014.

Citeaza:

  1. 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 (3), pp. 900-908, 2006.
  2. 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, Vol. 96, pp. 187-194, 2011.
  • H.M. Afsar, C. Prins and A.C. Santos, Exact and heuristics algorithms for solving the generalized vehicle routing problem with flexible fleet size, International Transactions in Operational Research, Vol.21, pp. 153-175, 2014.

Citeaza:

  1. 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, Lecture Notes in Artificial Intelligence, Vol. 6077, pp. 119-126, 2010.
  2. 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 and Control, Vol. 6, pp. 158-165, 2011.
  • F. Bonomo, D. Cornaz, T. Ekim and B. Ries, Perfectness of clustered graphs, Discrete Optimization, Vol.10, pp. 296-303, 2013.

Citeaza:

  1. M. Demange, J. Monnot, P.C. Pop and B. Ries,A genetic algorithm for solving the generalized vehicle routing problem, in Proc. of ISCO 2012,Lecture Notes in Computer Science, Vol. 7422, pp. 320-331, 2012.
  • Y. Jang, L. Zeng and Y. Luo, Multiobjective gate assignment based on passenger walking distance and fairness, Mathematical Problems in Engineering, Vol. 2013, article ID 361031, 7 pages, 2013.

Citeaza:

  1. C.-M. Pintea, P.C. Pop, C. Chira and D. Dumitrescu, A Hybrid Ant-based System for the Gate Assignment Problem, Lecture Notes in Computer Science, Vol. 5271, pp. 273-280, 2008.
  • H. Li, Y. Li, Q. Song, Y. Lu and J. Zhang, The tractor and semitriler routing considering carbon dioxide emissions, Mathematical Problems in Engineering, Vol. 2013, article ID 509160, 12 pages, 2013.

Citeaza:

  1. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  • H. Li, Y. Li, Y. Lu, Q. Song and J. Zhang, The effects of the tractor and semitriler routing problem on mitigation of carbon dioxide emissions, Discrete Dynamics in Nature and Society, Vol. 2013, article ID 809135, 14 pages, 2013.

Citeaza:

  1. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  • E. Owusu, Y. Zhan and Q.R. Mao, An SVM-AdaBoost facial expression recognition system, Applied Intelligence, Springer, Vol. 40, Issue 3, pp. 536-545, 2014.

Citeaza:

  1. O.Matei, P.C. Pop and H. Valean,Optical character recognition in real environments using neural networks and k-Nearest Neighbor, Applied Intelligence, Vol. 39(4), pp. 739-748, 2013.
  • M. Stanojevic, B. Stanojevic and M. Vujosevic, Enhanced savings calculation and its applications for solving capacitated vehicle routing problem, Applied Mathematics and Computation, Vol. 219, Issue 20, pp. 10302-10312, 2013.

Citeaza:

  1. 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.
  2. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  3. P.C. Pop, Generalized Network Design Problems: Modelling and Optimization, De Gruyter, 2012.
  • R. Levin and Y. Kanza, TARS: traffic-aware route search, GeoInformatica, Springer, July 2013.

Citeaza:

  1. P.C. Pop, New integer programming formulations of the generalized traveling salesman problem. American Journal of Applied Sciences, Vol. 4, pp. 932-937, 2007.
  • M. Tuba and R. Jovanovic, Improved ACO  algorithm with pheromone correction strategy for the travelling salesman problem, International Journal of Computers, Communications & Control, Vol. 8, No. 3, pp. 477-485, 2013.

Citeaza:

  1. 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.
  • N. Mladenovic, D. Urosevic, S. Hanafi and A. Ilic, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, European Journal of Operational Research, Vol. 220, pp. 270-285, 2012.

Citeaza:

  1. 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.
  • D. Karapetyan and G. Gutin, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, European Journal of Operational Research, Vol. 219(2), pp. 234-251, 2012.

Citeaza:

  1. 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.
  • M. Drexl, Applications of vehicle routing problem with trailers and transshipments, European Journal of Operational Research, Vol. 227(2), pp. 275-283, 2013.

Citeaza:

  1. P.C. Pop, I. Kara and H. Marc Andrei,New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  2. P.C. Pop, O. Matei and C. Pop Sitar, An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing, Vol. 109, pp. 76-83, 2013.
  • Z. Naji-Azimi and M. Salari, A complementary tool to enhance the effectiveness of existing methods for Heterogeneous Fixed Fleet Vehicle Routing Problem, Applied Mathematical Modelling, Vol. 37(6), pp. 4316-4324, 2013.

Citeaza:

  1. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  2. P.C. Pop, O. Matei and H. Valean, An efficient hybrid soft computing approach to the generalized vehicle routing problem, Advances in Inteligent and Soft Computing, Vol. 87, pp.281-289, 2011.
  • J.R. Ledesma and J.J. Salazar-Gonzales, A column generation approach for a school bus routing problem, Computers & Operations Research, Vol. 40(2), pp. 566-583, 2013.

Citeaza:

  1. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  • A. Dhavare, R.M. Low and M. Stamp, Efficient cryptanalysis of homophonic substitution ciphers, Cryptologia, Vol. 37(3), pp. 250-281, 2013.

Citeaza:

  1. P.C. Pop and I. Zelina, Heuristic Algorithms for the Generalized Minimum Spanning Tree Problem, Proc. of the International Conference on Theory and Applications of Mathematics and Informatics, Thessaloniki, Greece, pp. 385-395 , 2004.
  • B. Golden, Z. Naji-Azimi, S. Raghavan, M. Salari and P. Toth, The generalized covering salesman problem, INFORMS Journal on Computing, Vol. 24, No. 4, pp. 534-553, 2012.

Citeaza:

  1. 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.
  • J. He, Y. Zhang, G. Huang, Y. Shi and J. Cao, Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds, Journal of Computer and System Sciences, Vol. 78, pp. 1345-1358, 2012.

Citeaza:

  1. P.C. Pop,New models of the generalized minimum spanning tree problem, Journal of Mathematical Modelling and Algorithms, 3 (2), pp. 153-166, 2004.
  • R.A. Jabr, R. Singh and B.C. Pal, Minimum loss network reconfiguration using mixed-integer convex programming approach to the generalized minimum spanning tree problem, IEEE Transactions on Power Systems, Vol. 27(2), pp. 1106-1115, 2012.

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • C.-H. Cheng, S.C. Ho and C.-L. Kwan, The use of meta-heuristics for airport gate assignment, Expert Systems with Applications, Vol. 39(16), pp. 12430-12437, 2012.

Citeaza:

  1. C.-M. Pintea, P.C. Pop, C. Chira and D. Dumitrescu, A Hybrid Ant-based System for the Gate Assignment Problem, Lecture Notes in Computer Science, Vol. 5271, pp. 273-280, 2008.
  • C.S. Ferreira, L.S. Ochi, V. Parada and E. Uchoa, A GRASP-based approach to the generalized minimum spanning tree problem, Expert Systems with Applications, Vol. 39(3), pp. 3526-3536, 2012.

Citeaza:

  1. P.C. Pop, A survey of different integer programming formulations of the generalized minimum spanning tree problem, Carpathian Journal of Mathematics, 25 (1), pp. 104-118, 2009.
  • S.T. Brassai, B. Iantovics and and C. Enachescu, Optimization of robotic mobile agent navigation, Studies in Informatics and Control, Vol. 21, Issue 4, pp. 403-412, 2012.

Citeaza:

  1. C. Pintea, P.C. Pop and D. Dumitrescu, An ant based technique for the dynamic generalized traveling salesman problem, in Proc. of the 7-th WSEAS International Conference, pp. 255-259, Athens, 2007.
  • D. Karapetyan and G. Gutin, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, European Journal of Operational Research, Vol. 219, Issue 2, pp. 234-251, 2012.

Citeaza:

  1. 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.
  • M. Haouari, S.B. Layeb and G. Sherali, Tight compact models and comparative analysis for the prize collecting Steiner tree problem,Discrete Applied Mathematics, Vol. 161, Issue 4-5, pp. 618-632, 2013.

Citeaza:

  1. P.C. Pop, On the prize-collecting generalized minimum spanning tree problem, Annals of Operations Research, 150 (1), pp. 193-204, 2007.
  • D. Karapetyan and G. Gutin, Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem, European Journal of Operational Research, Vol. 208, Issue 3, pp. 221-232, 2011.

Citeaza:

  1. 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 (3), pp. 900-908, 2006.
  2. P.C. Pop, New integer programming formulations of the generalized traveling salesman problem, American Journal of Applied Sciences, 4, pp. 932-937, 2007.
  3. C. Pintea, P.C. Pop, C. Chira, The Generalized Traveling Salesman Problem solved with Ant Algorithms, Journal of Universal Computer Science, vol. 13, No. 7, pp. 1065-1075, 2007.
  • V. Cacchiani, A.E. F.Muritiba, M. Negreiros and P. Toth, A Multistart Heuristic for the Equality Generalized Traveling Salesman Problem,Networks, Vol. 57, Issue 3, pp. 231-239, 2011.

Citeaza:

  1. 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.
  • I. Contreras, E. Fernandez and A. Marin, The Tree of Hubs Location Problem, European Journal of Operational Research, Vol. 202, pp. 390-400, 2010.

Citeaza:

  1. 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 (3), pp. 900-908, 2006.
  • B. Hu, M. Leiner and G.R. Raidl, The generalized minimum edge biconnected network: Efficient Neighborhood structures for variable neighborhood search, Networks, Vol. 55(3), pp. 256-275, 2010.

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • T. Oncan, J.-F. Cardeau and G. Laporte, A Tabu Search Heuristic for the Generalized Minimum Spanning Tree Problem, European Journal of Operational Research 191, pp.306-319, 2008.

Citeaza:

  1. P.C. Pop, On the prize-collecting generalized minimum spanning tree problem, Annals of Operations Research, 150 (1), pp. 193-204, 2007.
  2. 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 (3), pp. 900-908, 2006.
  3. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • B. Hu, M. Leitner and G. Raidl, Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem,Journal of Heuristics 14 (5), pp. 473-499, 2008

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the GMST problem with bounded cluster size, Texts in Algorithms, 4, pp. 115-121. Proceedings of the first ACiD workshop, Durham 2005.
  • B. Golden, S. Raghavan and D. Stanojevic, The prize-collecting generalized minimum spanning tree problem, Journal of Heuristics 14 (1), pp. 69-93, 2008

Citeaza:

  1. P.C. Pop,New models of the generalized minimum spanning tree problem, Journal of Mathematical Modelling and Algorithms, 3 (2), pp. 153-166, 2004.
  2. P.C. Pop, W. Kern and G.J. Still, A new relaxation method for the generalized minimum spanning tree problem,European Journal of Operational Research, 170 (3), pp. 900-908, 2006.
  • C. Chira, C.-M. Pintea, D. Dumitrescu, An Agent-Based Approach to Combinatorial Optimization, Int. J. of Computers, Communications & Control, ISSN 1841-9836, E-ISSN 1841-9844, Vol. III (2008), Suppl. issue: Proceedings of ICCCC 2008, pp. 212-217, 2008

Citeaza:

  1. C. Pintea, P.C. Pop, C. Chira, The Generalized Traveling Salesman Problem solved with Ant Algorithms, Journal of Universal Computer Science, vol. 13, No. 7, pp. 1065-1075, 2007.
  • M. Penn, S. Rozenfeld, Approximation algorithm for the group Steiner network problem, Networks 49 (2), pp. 160-167, 2007

Citeaza:

  1. P.C. Pop, The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • C. Feremans, A. Grigoriev and R. Sitters, The geometric generalized minimum spanning tree problem with grid clustering, 4OR 4 (4), pp. 319-329, 2006

Citeaza:

  1. Pop, P.C.The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. Pop, P.C.New models of the generalized minimum spanning tree problem, Journal of Mathematical Modelling and Algorithms, 3 (2), pp. 153-166, 2004.
  3. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the GMST problem with bounded cluster size, Texts in Algorithms, 4, pp. 115-121, Proceedings of the first ACiD workshop, Durham 2005.
  • Z. Wang, C.H. Che, A. Lim, Tabu search for generalized minimum spanning tree problem , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4099 LNAI, pp. 918-922, 2006

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, A new relaxation method for the generalized minimum spanning tree problem,European Journal of Operational Research, 170 (3), pp. 900-908, 2006.
  • M. Haouari, J. Chaouachi, M. Dror, Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm, Journal of the Operational Research Society 56 (4), pp. 382-389, 2005

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • B. Golden, S. Raghavan and D. Stanojevic, Heuristic search for the generalized minimum spanning tree problem, INFORMS Journal on Computing 17 (3), pp. 290-304, 2005

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • C. Feremans, M. Labbe and G. Laporte, The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm, Networks 43 (2), pp. 71-86, 2004

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • C. Feremans, M. Labbe and G. Laporte, Generalized network design problems, European Journal of Operational Research 148 (1), pp. 1-13, 2003

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • C. Feremans, M. Labbe and G. Laporte, A Comparative Analysis of Several Formulations for the Generalized Minimum Spanning Tree Problem , Networks 39 (1), pp. 29-34, 2002

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.

112  CITARI IN REVISTE INDEXATE IN BAZE DE DATE INTERNATIONALE

  • D. Corus, P.K. Lehre and F. Neumann, The generalized minimum spanning tree problem: a parametrized complexity analysis of bi-level optimization, in Proc. of GECCO 2013, pp. 519-526, 2013.

Citeaza:

  1. P.C. Pop, New models of the generalized minimum spanning tree problem, Journal of Mathematical Modelling and Algorithms, 3 (2), pp. 153-166, 2004.
  • J.P-C. Chuang and P. Chu, Improving the public transit system for routes with scheduled headways, Yugoslav Journal of Operations Research, Vol. 23, No. 1, 2013.

Citeaza:

  1. 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.
  • S.T. Brassai, B. Iantovics and C. Enachescu, Artificial intelligence in the path planning optimization of mobile agent navigation, Vol. 3, pp. 243-250, 2012.

Citeaza:

  1. C. Pintea, P.C. Pop and D. Dumitrescu, An Ant-based Technique for the Dynamic Generalized Traveling Salesman Problem, 7th WSEAS International Conference on Systems Theory and Scientific Computation, pp. 255-259, 24-26 August, 2007, Athens, Greece.
  • B. Couetoux, J. Monnot and S. Toubaline, Complexity Results for the Empire Problem in Collection of Stars, Lecture Notes in Computer Science, Vol. 7402, pp. 73-82, 2012.

Citeaza:

  1. M. Demange, J. Monnot, P.C. Pop and B. Reis, Selective Graph Coloring in some Special Classes of Graphs, Lecture Notes in Computer Science, Vol. 7422, pp. 320-331, 2012.
  • Y. Ma, L. Li and J. Yang, A Gravitational Facility Location Problem based on Prize-Collecting Traveling Salesman Problem, IEEE Int. Conf. on Automation and Logistics, ICAL 2012, art. no. 6308257, pp. 511-516, 2012.

Citeaza:

  1. P.C. Pop, On the prize-collecting generalized minimum spanning tree problem, Annals of Operations Research, 150 (1), pp. 193-204, 2007.
  • D. Karapetyan and M. Reihaneh, An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem, Algorithmic Operations Research, Vol. 7, No. 1, pp. 22-29, 2012.

Citeaza:

  1. 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.
  • C.S. Babu, K.S. Babu and M.S. Murthy, Variant Minimum Spanning Network Connectivity Problem, International Journal of Advanced Research in Computer Science, Vol. 3, No. 1, 2012.

Citeaza:

  1. P.C. Pop, New models of the generalized minimum spanning tree problem Journal of Mathematical Modelling and Algorithms, 3 (2), pp. 153-166, 2004.
  • M. Mladenovic, R. Todosijevic and D. Urosevic, An efficient general variable neghborhood search for large Traveling Salesman Problem with time windows, Yugoslav Journal of Operations Research, Vol. 22, No. 2, 2012.

Citeaza:

  1. 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.
  • E. Osaba, R. Carballedo, F. Diaz and A. Perallos, Simulation Tool based on Memetic Algorithm to solve a Real Instance of a Dynamic TSP, in Proc. of Applied Simulation and Modelling, 2012.

Citeaza:

  1. P.C. Pop and S. Iordache, A hybrid heuristic approach for solving the generalized traveling salesman problem, in Proc. of GECCO 2011, Association for Computing Machinery, pp. 481-488, 2011.
  • N. Fan and J.-P. Watson, Solving the Connected Dominating Set and Power Dominating Set by Integer Programming, Lecture Notes in Computer Science, Springer, Vol. 7402, pp. 371-383, 2012.

Citeaza:

  1. P.C. Pop, A survey of different integer programming formulations of the generalized minimum spanning tree problem, Carpathian Journal of Mathematics, 25 (1), pp. 104-118, 2009.
  • B. Hu and G.R. Raidl, An evolutionary algorithm with solution archive and bounding extension for the generalized minimum spanning tree problem, in Proc. of GECCO 2012, Philadelphia, USA, ACM Press, 2012.

Citeaza:

  1. P.C. Pop, The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • B. Hu and G.R. Raidl, An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem, in Proc. of EUROCAST 2012, Lecture Notes in Computer Science, Springer, Vol. 6927, pp. 287-294, 2012.

Citeaza:

  1. P.C. Pop, The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • L.-M. Mou, The Continuous Selective Generalized Traveling Salesman Problem: An Efficient Ant Colony System, in Proc. of 8-th Int. Conf. on Natural Computation, ICNC 2012, pp. 1242-1246, 2012.

Citeaza:

  1. P.C. Pop, C. Pop Sitar, I. Zelina and I. Tascu, Exact algorithms for  generalized combinatorial optimization problems,Lecture Notes in Computer Science, Vol. 4616, pp. 154-162, 2007.
  2. O. Matei and P.C. Pop, An efficient genetic algorithm for solving the generalized traveling salesman person, , in Proc. of 6-th IEEE Int. Conf. on Intelligent Computer Communication and Processing, pp. 87-92, 2010.
  3. C. Pintea, P.C. Pop and C. Chira, Reinforcing ant colony system for the generalized traveling salesman problem, in Proc. of Int. Conf. in Bio-inspired Computing and Applications, pp. 245-252, 2006.
  • B. Rezaie, F. Esmaeili and H. Fazlollahtabar, Developing the concept of pricing in a deterministic homogenous vehicle routing problem with comprehensive sensitivity analysis, International Journal of Services and Operations Management, pp. 20-34, 2012.

Citeaza:

  1. P.C. Pop, I. Kara and H. Marc Andrei, New mathematical models of the generalized vehicle routing problem and extensions, Applied Mathematical Journal, Vol. 36, Issue 1, pp. 97-107, 2012.
  • I. Kara, H. Guden and O.N. Koc, New formulations for the generalized traveling salesman problem, in Proc. of the 6-th ASM 2012, pp. 60-66, 2012.

Citeaza:

  1. P.C. Pop, New integer programming formulations of the generalized traveling salesman problem, American Journal of Applied Sciences, 4, pp. 932-937, 2007.
  2. P.C. Pop, C. Pop Sitar, N. Pop and I. Zelina, A new approach to the generalized network design problems, in Proc. of the 6-th WSEAS International Conference, Corfu, 2007.
  3. C. Pintea, P.C. Pop and D. Dumitrescu, An ant based technique for the dynamic generalized traveling salesman problem, in Proc. of the 7-th WSEAS International Conference, pp. 255-259, Athens, 2007.
  • F.G. He and G.M. Shao, A minimum spanning tree problem in uncertain networks, Advances in Intelligent and Soft Computing, Vol. 128, pp. 677-683, 2011.

Citeaza:

  1. P.C. Pop, New models of the generalized minimum spanning tree problem, Journal of Mathematical Modelling and Algorithms, 3 (2), pp. 153-166, 2004.
  • J.Y. Kanda, A.C.P.L.F. de Carvalho, E.R. Hruschka and C. Soares, Using Meta-learning to Recommend Meta-heuristics for the Traveling Salesman Problem, in Proc. of ICMLA 2011, Vol. 1, pp. 346-351, 2011.

Citeaza:

  1. P.C. Pop, O. Matei and C. Sabo, A new approach for solving the generalized traveling salesman problem, Lecture Notes in Computer Science, Vol. 6373, pp. 62-72, 2010.
  • C. Chira, J. Sedano, J.R. Villarm, M. Camara and E. Corchado, Evolutionary model support for urban bicycles renting systems, in Proceedings of ISDA 2011, article no. 6121758, pp. 819-824, 2011.

Citeaza:

  1. P.C. Pop, O. Matei, C. Pop Sitar and C. Chira, A genetic algorithm for solving the generalized vehicle routing problem,Proc. of HAIS 2010, Lecture Notei in Artificial Intelligence, Vol. 6077, pp. 119-126, 2010.
  • N.D. Lagaros and M.G. Karlaftis, A critical assessment of metaheuristics for scheduling emergency infrastructure inspections, Swarm and Evolutionary Computation, Vol. 1, Issue 3, pp. 147-163, 2011.

Citeaza:

  1. P.C. Pop, New integer programming formulations of the generalized traveling salesman problem. American Journal of Applied Sciences, Vol. 4, pp. 932-937, 2007.
  2. P.C. Pop, O. Matei and C. Sabo, A new approach for solving the generalized traveling salesman problem, Lecture Notes in Computer Science, Vol. 6373, pp. 62-72, 2010.
  • L.-M. Mou, An efficient ant colony system for solving the new generalized traveling salesman problem, in Proc. of IEEE Int. Conf. on Cloud Computing and Inelligence Systems, CCIS 2011, pp. 407-412, 2011.

Citeaza:

  1. P.C. Pop, C. Pop Sitar, I. Zelina and I. Tascu, Exact algorithms for  generalized combinatorial optimization problems,Lecture Notes in Computer Science, Vol. 4616, pp. 154-162, 2007.
  2. P.C. Pop, O. Matei and C. Sabo, A new approach for solving the generalized traveling salesman problem, Lecture Notes in Computer Science, Vol. 6373, pp. 62-72, 2010.
  3. O. Matei and P.C. Pop, An efficient genetic algorithm for solving the generalized traveling salesman person, in Proc. of 6-th IEEE Int. Conf. on Intelligent Computer Communication and Processing, pp. 87-92, 2010.
  4. C. Pintea, P.C. Pop and C. Chira, Reinforcing ant colony system for the generalized traveling salesman problem, in Proc. of Int. Conf. in Bio-inspired Computing and Applications, pp. 245-252, 2006.
  • L.-M. Mou, A novel ant colony system with double pheromones for the generalized TSP, in Proc. of the 7-th Int. Conf. on Natural Computing, ICNC 2011, Vol. 4, Art. no. 6022580, pp. 1923-1928, 2011.

Citeaza:

  1. P.C. Pop, C. Pop Sitar, I. Zelina and I. Tascu, Exact algorithms for  generalized combinatorial optimization problems,Lecture Notes in Computer Science, Vol. 4616, pp. 154-162, 2007.
  2. P.C. Pop, O. Matei and C. Sabo, A new approach for solving the generalized traveling salesman problem, Lecture Notes in Computer Science, Vol. 6373, pp. 62-72, 2010.
  3. O. Matei and P.C. Pop, An efficient genetic algorithm for solving the generalized traveling salesman person, in Proc. of 6-th IEEE Int. Conf. on Intelligent Computer Communication and Processing, pp. 87-92, 2010.
  4. C. Pintea, P.C. Pop and C. Chira, Reinforcing ant colony system for the generalized traveling salesman problem, in Proc. of Int. Conf. in Bio-inspired Computing and Applications, pp. 245-252, 2006.
  • S. Slusny and R. Neruda, Local Search Heuristics for Robot Routing Planner, Lecture Notes in Computer Science, Vol. 6677, pp. 34-40, 2011.

Citeaza:

  1. P.C. Pop, New integer programming formulations of the generalized traveling salesman problem. American Journal of Applied Sciences, Vol. 4, pp. 932-937, 2007.
  • R. Bartak, M. Zerola and S. Slusny, Towards routing for autonomous robots: Using constraint programming in an anytime path planner, in Proc. of ICAART 2011, Vol. 1, pp. 313-320, 2011.

Citeaza:

  1. P.C. Pop, New integer programming formulations of the generalized traveling salesman problem. American Journal of Applied Sciences, Vol. 4, pp. 932-937, 2007.
  • A. Fujiyoshi and M. Suzuki, Minimum spanning tree problem with label selection, IEICE  Transactions on Information and Systems, Vol. E94-D, Issue 2, pp. 233-239, 2011.

Citeaza:

  1. P.C. Pop, The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • E. Filip and M. Otakar, The Travelling Salesman Problem and its Application in Logistic Practice, WSEAS Transactions on Business and Economics, Vol. 8, Issue 4, pp. 163-173, 2011.

Citeaza:

  1. C. Pintea, P.C. Pop and D. Dumitrescu, An Ant-based Technique for the Dynamic Generalized Traveling Salesman Problem,7th WSEAS International Conference on SYSTEMS THEORY AND SCIENTIFIC COMPUTATION, pp. 255-259, 24-26 August, 2007, Athens, Greece.
  • B. Hu and G.R. Raidl, An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem with label selection, in Proc. of EUROCAST 2011, Las Palmas de Gran Canaria, February 6-11, pp. 233-239, 2011.

Citeaza:

  1. P.C. Pop, The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • H. Jiang and Y. Chen, An efficient algorithm for generalized minimum spanning tree problem, Proc. of 12-th Annual Conf. on Genetic and evolutionary computation, Portland, Oregano, USA, pp. 217-224 , 2010.

Citeaza:

  1. P.C. Pop, The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • D.A. Orozova and V.G.  Jecheva, Generalized Net Model of E-learning System with Privacy Protection Module, in  Technological Developments in Education and Automation, Springer, pp. 309-313 , 2010.

Citeaza:

  1. G. Hadjicharalambous, P.C. Pop, E. Pyrga, G. Tsaggouris and C.D. Zaroliagis, The Railway Travelling Salesman Problem, Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, Vol. 4359, pp. 264-275, 2007.
  • D. Karapetyan, Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms, PhD thesis, University of London, UK, 2010.

Citeaza:

  1. C. Pintea, P.C. Pop, C. Chira, The Generalized Traveling Salesman Problem solved with Ant Algorithms, Journal of Universal Computer Science, vol. 13, No. 7, pp. 1065-1075, 2007.
  • I. Tanackov, D. Simić, J. Mihaljev-Martinov, G. Stojić and S. Sremac, The Spatial Pheromone Signal for Ant Colony Optimization, Lecture Notes in Computer Science, Springer Verlag, Vol. 5788,  pp. 400-407 , 2009.

Citeaza:

  1. P.C. Pop, C.M. Pintea and C. Pop Sitar, An Ant-Based Heuristic for the Railway Traveling Salesman Problem, Lecture Notes in Computer Science, Vol. 4448, pp. 702-711, 2007.
  • S.A. Choudum and I. Raman, Embedding height balanced trees and Fibonacci trees in hypercubes, Journal of Applied Mathematics and Computing, Springer Verlag, Vol. 30, No. 1-2,  pp. 39-52 , 2009.

Citeaza:

  1. 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.
  • J.-C. Lin, Fault-Tolerant Mapping of a Mesh Network in a Flexible Hypercube, WSEAS Transactions on Computers, Vol. 30, Issue 9,  pp. 1587-1596, 2009.

Citeaza:

  1. I. Zelina, P.C. Pop, Corina Pop Sitar and Ioana Tascu, A parallel algorithm for Interpolation in Pancake Graph, Proceedings of 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems, pp. 98-101, 16-19 February, 2007, Corfu Island, Greece.
  • A. Fujiyoshi and M. Suzuki, Minimum Spanning Tree Problem with Label Selection and its Applications to OCR, Proc. of the Japan Conference on Computational Geometry and  Graphs, 11-13 November, Kanazawa, Ishikawa, Japan, 2009.

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • A. Tramontani, Enhanced Mixed Integer Programming Techniques and Routing Problems, PhD thesis, Bologna University, Italy, 2009.

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, A new relaxation method for the generalized minimum spanning tree problem,European Journal of Operational Research, 170 (3), pp. 900-908, 2006.
  2. P.C. Pop, W. Kern, and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  3. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • Z. Naji-Azimi, Algorithms for Combinatorial Optimization Problems, PhD thesis, Bologna University, Italy, 2009.

Citeaza:

  1. C. Pintea, P.C. Pop, C. Chira, The Generalized Traveling Salesman Problem solved with Ant Algorithms, Journal of Universal Computer Science, vol. 13, No. 7, pp. 1065-1075, 2007.
  • O.O. Ekabua, Change Impact Analysis Model-Based Framework for Service Provisioning  in a Grid Environment, PhD thesis, University of Zululand, South Africa, 2009.

Citeaza:

  1. P.C. Pop and I. Zelina, Heuristic Algorithms for the Generalized Minimum Spanning Tree Problem, Proc. of the International Conference on Theory and Applications of Mathematics and Informatics, Thessaloniki, Greece, pp. 385-395 , 2004.
  • Dziwiński, P., Rutkowska, D., Ant focused crawling algorithm, Lecture Notes in Computer Science, Springer Verlag, Vol. 5097 LNAI, 2008, pp. 1018-1028, 2008

Citeaza:

  1. C. Pintea, P.C. Pop and D. Dumitrescu, An Ant-based Technique for the Dynamic Generalized Traveling Salesman Problem,7th WSEAS International Conference on SYSTEMS THEORY AND SCIENTIFIC COMPUTATION, pp. 255-259, 24-26 August, 2007, Athens, Greece.
  • C. Chira, C.-M. Pintea, D. Dumitrescu, Sensitive Stigmergic Agent Systems — A Hybrid Approach to Combinatorial Optimization, Advances in Soft Computing, Springer Verlag, Vol. 44, pp. 33-39, 2008

Citeaza:

  1. C-M. 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.
  • V. Cacchiani, A.E.F. Muritiba, M. Negreiros, P. Toth, A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem, Proc. Seventh Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Vol. 44, pp. 136-138, Gargnano, Italy, 13-15 May, 2008

Citeaza:

  1. C-M. 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.
  • B. Hu and G. Raidl, Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem, In Fatos Xhafa, Francisco Herrera, Ajith Abraham, Mario Köppen, and Jose Manuel Benitez, editors, 8th International Conference on Hybrid Intelligent Systems – HIS 2008, pages 73-77, Barcelona, Spain, 2008.

Citeaza:

  1. G. Hadjicharalambous, P.C. Pop, E. Pyrga, G. Tsaggouris and C.D. Zaroliagis, The Railway Travelling Salesman Problem, Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, Vol. 4359, pp. 264-275, 2007.
  2. 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.
  • C. Chira, C. Pintea and D. Dumitrescu, A Multi-Agent Stigmergic Model for Complex Optimization Problems, In Zadeh L.A., Tufis D., Filip F.G., Dzitac I. (Editors), From Natural Language to Soft Computing: New Paradigms in Artificial Intelligence, Editing House of Romanian Academy, Bucharest, ISBN 978-973-27-1678-6, pp. 51-62, 2008

Citeaza:

  1. C-M. Pintea, P.C. Pop and C. Chira, Reinforcing Ant Colony System for the Generalized Traveling Salesman Problem, Proc. BIC-TA, vol. Evolutionary Computing, 245-252, 2006.
  2. C-M. Pintea, P.C. Pop and D. Dumitrescu, An Ant-based Technique for the Dynamic Generalized Traveling Salesman Problem, Proc. of the 7-th WSEAS Int. Conf. on Systems Theory and Scientific Computation, pp. 257-261, 2007.
  • S.-J. Wu, J.-C. Lin and K.T. Chu, Faulty-tolerant algorithm for mapping a complete binary tree in an IEH, WSEAS Transactions on Computers, Volume 7 ,  Issue 3  (March 2008), pp. 83-88, 2008.

Citeaza:

  1. I. Zelina, P.C. Pop, Corina Pop Sitar and Ioana Tascu, A parallel algorithm for Interpolation in Pancake Graph, Proceedings of 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems, pp. 98-101, 16-19 February, 2007, Corfu Island, Greece.
  • J.-C. Lin, Load-balance and fault-tolerance for embedding a complete binary tree in an IEH with N-expansion, WSEAS Transactions on Computers, Volume 7 ,  Issue 7  (July 2008), pp. 919-928, 2008.

Citeaza:

  1. I. Zelina, P.C. Pop, Corina Pop Sitar and Ioana Tascu, A parallel algorithm for Interpolation in Pancake Graph, Proceedings of 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems, pp. 98-101, 16-19 February, 2007, Corfu Island, Greece.
  • C. Chira, C.-M. Pintea and D. Dumitrescu, A Hybrid Agent-Based Approach to Combinatorial Optimization, Computational Intelligence Reports, No. 062007, 2007

Citeaza:

  1. C-M. 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.
  • C. Chira, C.-M. Pintea and D. Dumitrescu, Sensitivity and Stigmergy in Agent-Based Systems, Computational Intelligence Reports,No. 032007, 2007

Citeaza:

  1. C-M. 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.
  • C. Chira, D. Dumitrescu and R. Gaceanu, Stigmergic Agent System for Solving NP-hard Problems, Special Issue of Studia Univ. Babes-Bolyai Informatica: Proceedings of the International Conference on Knowledge Engineering: Principles and Techniques, KEPT 2007, pp.177-184, 2007.

Citeaza:

  1. C-M. Pintea, P.C. Pop and C. Chira, Reinforcing Ant Colony System for the Generalized Traveling Salesman Problem,Proc. BIC-TA, vol. Evolutionary computing, pp. 245-262, 2006.
  • B. Hu, Hybrid Metaheuristics for Generalized Network Design Problems, PhD thesis, Vienna University of Technology, Austria, 2008

Citeaza:

  1. Pop, P.C.The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. 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.
  3. G. Hadjicharalambous, P.C. Pop, E. Pyrga, G. Tsaggouris and C.D. Zaroliagis, The Railway Travelling Salesman Problem, Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, Vol. 4359, pp. 264-275, 2007.
  4. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the GMST problem with bounded cluster size, Texts in Algorithms, 4, pp. 115-121, Proceedings of the first ACiD workshop, Durham 2005.
  5. P.C. Pop, C.D. Zaroliagis and G. Hadjicaralambous, A cutting plane approach to solve the Railway Traveling Salesman Problem, Studia Universitatis Mathematica, vol. 53 (1), pp. 63-72, 2008.
  • C.M. Pintea, Combinatorial optimization with bio-inspired computing, PhD thesis, Babes-Bolyai University of Cluj-Napoca, Romania, 2008

Citeaza:

  1. 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.
  2. P.C. Pop, C. Pintea and C. 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.
  3. G. Hadjicharalambous, P.C. Pop, E. Pyrga, G. Tsaggouris and C.D. Zaroliagis, The Railway Travelling Salesman Problem, Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, Vol. 4359, pp. 264-275, 2007.
  4. 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.
  5. Camelia Pintea, Petrica Pop and Camelia Chira, The Generalized Traveling Salesman Problem Solved with Ant Algorithms, Journal of Universal Computer Science, vol. 13, No. 7, pp. 1065-1075, 2007.
  6. 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.
  • I. Zelina, Probleme de optim in sisteme distribuite, PhD thesis, Babes-Bolyai University of Cluj-Napoca, Romania, 2008

Citeaza:

  1. I. Zelina, G. Moldovan and P.C. Pop, Some Communication Aspects in Extended Fibonacci Cubes, to appear in the IEEE Proceedings of International Symposium on Applications and the Internet, IEEE Computer Society Press, Turku, Finland, 2008.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. P.C. Pop, C. Pop Sitar and I. Zelina, Efficient Algorithms for the Generalized Minimum Spanning Tree Problem, Carpathian Journal of Mathematics, Vol. 20, No. 1, pp. 109-117, 2004.
  • B. Hu, M. Leitner, and G. R. Raidl. The Generalized Minimum Edge Biconnected Problem: Efficient Neighborhood Structures for Variable Neighborhood Search, Technical Report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology, 2007, submitted to Networks.

Citeaza:

  1. Pop, P.C.The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • M. Leitner. Solving two generalized network design problems with exact and heuristic methods. Master thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, 2006.

Citeaza:

  1. Pop, P.C.The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the GMST problem with bounded cluster size, Texts in Algorithms, 4, pp. 115-121, Proceedings of the first ACiD workshop, Durham 2005.
  • B. Hu, M. Leitner, and G. R. Raidl. Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. Technical Report TR 186-1-06-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology, 2006, submitted to Journal of Heuristics.

Citeaza:

  1. Pop, P.C.The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the GMST problem with bounded cluster size, Texts in Algorithms, 4, pp. 115-121, Proceedings of the first ACiD workshop, Durham 2005.
  • C. Feremans, A. Lodi, P. Toth, A. Tramontani, Improving on Branch-and-cut Algorithms for generalized minimum spanning trees, Pacific Journal of Optimization, 1, pp. 491-508, 2005.

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  3. P.C. Pop,New models of the generalized minimum spanning tree problem Journal of Mathematical Modelling and Algorithms, 3 (2), pp. 153-166, 2004.
  • I. Gamvros, B. Golden, S. Raghavan and D. Stanojevic. Heuristic search for network design. In Tutorials on emerging methodologies and applications in operations research, Springer’s International Series Operations Research & Management Science, edited by H. Greenberg, pp. 1-46, 2005, ISSN 0884-8289

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • B. Hu, M. Leitner, and G. R. Raidl. Computing generalized minimum spanning trees with variable neighborhood search. In P. Hansen, N. Mladenovic, J. A. M. Pérez, B. M. Batista, and J. M. Moreno-Vega, editors, Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, Tenerife, Spain, 2005.

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the GMST problem with bounded cluster size, Texts in Algorithms, 4, pp. 115-121, Proceedings of the first ACiD workshop, Durham 2005.
  • D. Stanojevic, Optimization of contemporary telecommunications networks: generalized spanning trees and WDM optical network, PhD thesis, University of Maryland, USA, 2005.

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  3. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  4. P.C. Pop, W. Kern and G.J. Still, A new relaxation method for the generalized minimum spanning tree problemEuropean Journal of Operational Research, to appear – available online at www.sciencedirect.com.
  • Computing generalized minimum spanning trees with variable neighborhood search. In P. Hansen, N. Mladenovic, J. A. M. Pérez, B. M. Batista, and J. M. Moreno-Vega, editors, Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, Tenerife, Spain, 2005.

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the GMST problem with bounded cluster size, Texts in Algorithms, 4, pp. 115-121, Proceedings of the first ACiD workshop, Durham 2005.
  • A.K. Das, P. Arabshahi and A. Gray, An ant colony system approach for solving the at-least version of the generalized minimum spanning tree problem, Proceedings – 2005 IEEE Swarm Intelligence Symposium, SIS 2005, art. no. 1501603, pp. 63-70

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  3. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • Fabiano V. de Alvarenga and Marcelo L. Rocha, Uma Metaheurística Grasp Para o Problema da Árvore Geradora de Custo Mínimo com Grupamentos Utilizando Grafos Fuzzy, INFOCOMP Journal of Computer Science, Vol. 5, No. 1, pp. 66-75, 2005

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop,New models of the generalized minimum spanning tree problem. Journal of Mathematical Modelling and Algorithms, 3 (2), pp. 153-166, 2004.
  • G. Tsaggouris and C. Zaroliagis, A Compendium of Large-Scale Network Optimization Problems, Collection of Important Test Instances and Implementations across all Workpackages, Delis project, 2006

Citeaza:

  1. G. Hadjicharalambous, P.C. Pop, E. Pyrga, G. Tsaggouris and C.D. Zaroliagis, The Railway Travelling Salesman Problem, Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, Vol. 4359, pp. 264-275, 2007.
  • O. Gustafsson, H. Ohlsson and L. Wanhammar, Improved multiple constant multiplication using a minimum spanning tree , Conference Record – Asilomar Conference on Signals, Systems and Computers 1, pp. 63-66, 2004

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  • C. Feremans and A. Grigoriev. An approximation scheme for the generalized geometric minimum spanning tree problem with grid clustering. Technical Report NEP-ALL-2004-09-30, Maastricht: METEOR, Maastricht Research School of Economics of Technology and Organization, 2004

Citeaza:

  1. P.C. Pop,The generalized minimum spanning tree problem. Ph.D. thesis, Department of Operations Research and Mathematical Programming, University of Twente, Enschede, The Netherlands, 2002.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • C. Zaroliagis. A compendium of large-scale network optimization problems. DELIS Technical Report, 2004

Citeaza:

  1. G. Hadjicharalambous, P.C. Pop, E. Pyrga, G. Tsaggouris and C.D. Zaroliagis, The Railway Travelling Salesman Problem, Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, to appear.
  • D. Ghosh, A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem. Technical Report NEP-CMP-2003-07-02, Indian Institute of Management, Research and Publication Department, Ahmedabad, India, 2003

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • D. Ghosh, Solving medium to large sized Euclidean generalized minimum spanning tree problems. Technical Report NEP-CMP-2003-08-02, Indian Institute of Management, Research and Publication Department, Ahmedabad, India, 2003

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.
  • C. Feremans, Generalized Spanning trees and extensions, PhD thesis, University of Bruxelles, Belgium, 2001

Citeaza:

  1. P.C. Pop, W. Kern and G.J. Still, The generalized minimum spanning tree problem. Memorandum, No. 1542, University of Twente, the Netherlands, 2000.
  2. P.C. Pop, W. Kern and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. Memorandum, No. 1577, University of Twente, the Netherlands, 2001.

MEMBRU IN COMITETUL STIINTIFIC AL UNOR CONFERINTE

  • Genetic and Evolutionary Computation Conference, Philadelphia, USA, 7-11 July, 2012;
  • International Symposium on Applications and the Internet (SAINT 2012), 16 – 20 July 2012, Izmir, Turkey;
  • International Conference on Evolutionary Computation Theory and Applications (ECTA 2012), 5-7 October, 2012, Barcelona, Spain;
  • International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2012), 5th – 8th September 2012, Ostrava, Czech Republic;
  • The 7-th International Conference on Hybrid Artificial Intelligent Systems (HAIS 2012), 28th-30th March 2012, Salamanca, Spain;
  • Genetic and Evolutionary Computation Conference, Dublin, Ireland, 12-16 July, 2011;
  • International Conference on Evolutionary Computation Theory and Applications (ECTA 2011), 24-26 October, 2011, Paris, France;
  • International Conference on Soft Computing Models in Industrial and Environmental Applications, Salamanca, Spain, 6th – 8th April 2011;
  • The 6-th International Conference on Hybrid Artificial Intelligent Systems (HAIS 2011), 23rd-25th May 2011, Wroclaw, Poland;
  • 5-th International Workshop on Nature Inspired Cooperative Strategies for Optimization (NICSO 2011), Cluj-Napoca, Romania, 20 – 22 October 2011;
  • 3-rd Workshop on Heuristic Methods for Design, Deployment and Reliability of Networks and Network Applications (HEUNET 2011), in conjuction with SAINT 2011, Munich, Germany, 18-22 July 2011;
  • 7-th International Conference on Natural Computing (ICNC’11), Shanghai, China, 26-28 July, 2011;
  • 3rd International Conference on Agents and Artificial Intelligence (ICAART 2011), Rome, Italy, 28-30 January 2011;
  • 3rd World Congress on Nature and Biologically Inspired Computing (NaBIC 2011), Salamanca, Spain, 19-21 October 2011;
  • The 6-th International Conference on Natural Computing (ICNC’10), Yantai, China, 10-12 August 2010;
  • International Conference on Evolutionary Computation, (ICEC 2010), Valencia, Spain, 24-26 October 2010;
  • 7-th International Workshop on Hybrid Metaheuristics, Vienna, Austria, October 1st -2nd, 2010;
  • Second Workshop on Heuristic Methods for Design, Deployment and Reliability of Networks and Network Applications (HEUNET 2010), in conjuction with SAINT 2010, Seoul, Korea, 19-23 July 2010;
  • The 5-th International Conference on Hybrid Artificial Intelligent Systems (HAIS 2010), 23rd-25th June 2010, San Sebastian, Spain;
  • International Conference on Computers, Coomunications and Control (ICCC 2010), Baile Felix, Oradea, Romania, 12-16 May, 2010;
  • 12th International Symposium on Symbolic and Numeric Algorithms for Scientifc Computing (SYNASC 2010), Timisoara, Romania, 23-26 September, 2010;
  • 7-th International Conference on Applied Mathematics (ICAM 7), Baia Mare, 1-4 September, 2010;
  • The 9-th Balkan Conference on Operational Research (BALCOR 2009), Constanta, Romania, 2-6 September, 2009;
  • WSC 2009 Online World Conference on Soft Computing in Industrial Applications 17 – 29 of November 2009;
  • Heuristic Methods for Design, Deployment and Reliability of Networks and Network Applications (HEUNET 2008), in conjunction with SAINT 2008, Turku, Finlanda, 28 Iulie – 1 August 2008;
  • AIC’08, ISTASC’08, ISCGAV’08, Insula Rhodos, Grecia, August 2008;
  • WSC 2008 Online World Conference on Soft Computing in Industrial Applications 10th – 21st of November 2008 Online Conference on the Internet.

VIZITE DIDACTICE SI DE CERCETARE INTERNATIONALE

2009 – International Centre for Theoretical Physics, Trieste, Italy; University of L’Aquila, Italy; University of Applied Sciences, Vienna, Austria.

2008 – LABORATOIRE JACQUES-LOUIS LIONS (UMR 7598), Pierre et Marie Curie University, Paris, France.

2007 – Technical University of Vienna; Johann Radon Institute, Linz; University of Applied Sciences, Vienna, Austria.

2006 – LABORATOIRE JACQUES-LOUIS LIONS (UMR 7598), Pierre et Marie Curie University, Paris, France; University of Applied Sciences, Vienna, Austria.

2005 – Technical University of Vienna, Austria.

2004 – Instituto per le Applicazioni del Calcolo „M. Picone”, Bari, Italy, University of Patras, Greece.