METODE ALGORITMICE DE REZOLVARE A PROBLEMELOR DE OPTIMIZARE COMBINATORICA
PETRICA CLAUDIU POP
DATA SI LOCUL NASTERII: 30 Octombrie 1972.
DOMENII DE SPECIALITATE:

Cercetari Operationale; Programare Matematica; Optimizare Combinatorica; Analiza Matematica; Optimizare; Modelare Matematica; Metode numerice; Ecuatiile fizicii matematice; Analiza Convexa; Teoria controlului optimal.

STUDII:

  • 1998-2002 Doctorat: Matematica, Cercetari Operationale; Facultatea de Matematica Aplicata, Universitatea din Twente, Olanda; Titlul tezei: The Generalized Minimum Spanning Tree Problem; Conducatori de lucrare: Prof. Dr. U. Faigle and Prof. Dr. G. Woeginger.
  • 1997-1998 Masterat: Cercetari Operationale (absolvit cu calificative foarte bune si excelente); Facultatea de Matematica Aplicata, Universitatea din Twente, Olanda; Titlul tezei: Semidefinite Programming and its Applications to Combinatorial Optimization; Conducator de lucrare: Prof. Dr. U. Faigle.
  • 1995-1996 Masterat: Analiza Convexa si Aproximare (absolvit cu 10); Facultatea de Matematica si Informatica, Universitatea Babes-Bolyai, Cluj-Napoca; Titlul tezei: Optimal Maintenance of Machines; Conducator de lucrare: Prof. Dr. I. Muntean.
  • 1991-1995 Facultatea de Matematica si Informatica, Universitatea Babes-Bolyai, Cluj-Napoca.
  • 1987-1991 Liceul “Gheorghe Sincai", Baia Mare.
  • 1979-1987 Scoala primara si secundara “Nichita Stanescu", Baia Mare.

FUNCTII DIDACTICE:

  • 1997 - 1999 Preparator, Departamentul de Matematica si Informatica, Universitatea de Nord, Baia Mare.
  • 1999 - 2003 Asistent, Departamentul de Matematica si Informatica, Universitatea de Nord, Baia Mare.
  • 2003 - 2006 Lector, Departamentul de Matematica si Informatica, Universitatea de Nord, Baia Mare.
  • 2006 - Conferentiar, Departamentul de Matematica si Informatica, Universitatea de Nord, Baia Mare.

CURSURI PREDATE:

  • Optimizare Combinatorica (2005), la Master, Universitatea Tehnica Viena, Austria. Capitole Speciale de Analiza Matematica (2005 - ), la Master, Universitatea de Nord, Baia Mare;
  • Metode numerice de rezolvare a problemelor de optimizare (2006 - ), la Master, Universitatea de Nord, Baia Mare;
  • Inteligenta Artificiala, (2004-2005, 2007 - );
  • Cercetari Operationale (2003 - );
  • Analiza Functionala (2004 - );
  • Matematici Speciale (2003 - 2005);
  • Analiza Functionala (2004 - );
  • Analiza Convexa, Programare Matematica (2004 -2005);
  • Modelare Matematica si Simulare (2004 - );

ACTIVITATE STIINTIFICA:

  • Carti in edituri: 2
  • Lucrari in reviste si volume ale unor conferinte internationale: 35
  • Contracte de cercetare: 8
  • Comunicari la conferinte nationale si internationale peste 20.

BURSE (castigate pe baza de competitie):

  • 1998 - 2002 Bursa de doctorat, Facultatea de Matematica Aplicata, Universitatea Twente, Olanda.
  • Bursa Tempus, Universitatea "Pierre et Marie Curie", Paris VI, Frant¸a, 1 May - 1 August, 1996.
  • Bursa CNRS (Centre National de la Recherche Scientifique), "Pierre et Marie Curie" University, Paris VI, Franta, Ianuarie 1997.
  • Bursa de Master, Mathematical Research Institute, Olanda, Septembrie 1997 - Iunie 1998.
  • Scoala de vara, "Probability and Statistics", Iulie 1999, Cortona, Italia.
  • Scoala de iarna, "New Methods in Combinatorial Optimization", Martie 2000, Alpe d’Huez, Franta.
  • Scoala de vara, "Operations Research. Network Flows", August 2000, Cortona, Italia.

VIZITE SI STAGII DE PREGATIRE:

  • Visiting researcher, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, Martie - Mai 2001.
  • Conferinta invitata cu titlul: The Generalized Minimum Spanning Tree Problem, McMaster University, Hamilton, Ontario, Canada, Aprilie, 2001.
  • Conferinta invitata cu titlul: Approximation Results for the Generalized Minimum Spanning Tree Problem, Universitatea din Patras, Grecia, Iunie 2002.
  • Conferinta invitata cu titlul: Solving the Generalized Minimum Spanning Tree Problem with Simulated Annealing, Universitatea din Viena, Austria, Aprilie 2005.

PROIECTE DE CERCETARE-DEZVOLTARE PE BAZA DE CONTRACT/GRANT:

Ca director in cadrul urmatoarelor proiecte de cercetare obtinute pe baza de competitie:

  • "Metode algoritmice pentru rezolvarea problemelor de optimizare", programul Centre de cercetare de excelenta CEEX, ET34/2006, 2006-2008.
  • "Metode algoritmice pentru rezolvarea problemelor de optimizare", programul Centre de cercetare de excelenta CEEX, ET34/2006, 2006-2008.

MEMBRU IN URMATOARELE PROGRAME DE CERCETARE-DEZVOLTARE:

  • Modele computationale inspirate din natura. Noi paradigme si metaeuristici. Aplicatii reale, CNCSIS, grant de Tip A, 2007-2009.
  • In cadrul proiectului PICS Mathematique et applications, CNRS, Franta, in care sunt implicate universitati din Franta si Romania. Pe tema pe care am propus-o "Recherche Operationelle: modelisation mathematique, optimisation et approche algorithmique" fac parte din echipa de cercetare.
  • "Algorithmic Discrete Optimization Network" ADONET (program finantat de Uniunea Europeana), pentru perioada 10 August 2005 - 9 Noiembrie 2005, la Universitatea Tehnica din Viena
  • NATO Senior fellowship, Istitutul Applicazioni del Calcolo "M. Picone", Bari, Italia, pentru perioada August 2004 - Octombrie 2004.
  • AMORE "Algorithmic Methods for Optimizing the Railways in Europe" (program finantat de Uniunea Europeana), pentru perioada Februarie 2003 - Februarie 2004, la Universitatea din Patras, Grecia.
  • Prezentarea Nationala a Romaniei la cel de-al 10-lea Congres de Educatie Matematic a (ICME 10), 4-11 iulie 2004, Copenhaga, Danemarca; Guvernul Romaniei, 6 luni (1 martie 2004 - 31 august 2004, 53000 RON.

CONTIBUTII EDITORIALE:

Contributing Editor IAOR (International Abstracts in Operations Research).

  • Referent de specialitate: Mathematical Reviews si Zentralblatt fur Mathematika si European Journal of Operational Research, 4 Operations Research, Networks, Journal of Heuristics, Carpathian Journal of Mathematics, WSEAS Journals and bConferences, Creative Mathematics and Informatics.
  • Secretar Stiintific: Carpathian Journal of Mathematics.

MEMBRU IN SOCIETATI STIINTIFICE:

  • Membru al Societatii Romane de Matematica (SSMR);
  • Membru al Societatii Olandeze de Cercetare Operationala, LNMB.

PUBLICATII:


  1. Articole publicate in reviste cotate ISI:

    1. P.C. Pop, On the Prize-Collecting Generalized Minimum Spanning Tree Problem, Annals of Operations Research, Vol. 150, No. 1, pp. 193-204, 2007.
    2. 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.
    3. 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.
    4. 4. 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.

  2. Articole publicate in volumele unor conferinte internationale cotate ISI:

    1. 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.
    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, to appear in Lecture Notes in Computer Science.
    4. P.C. Pop, C. Pintea, C. Pop Sitar and D. Dumitrescu, Ant Colony Approach for a Dynamic Railway Problem, to appear in the Proceedings of the 9th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, September 26-29, 2007.

  3. Articole publicate in jurnale indexate in baze de date internationale:

    1. 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.
    2. 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.
    3. P.C. Pop, C. Pop Sitar and A. Horvat Marc, A local global approach to the Generalized Minimum Spanning Tree Problem, to appear in Journal of Computer Science.
    4. 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.
    5. P.C. Pop, A Lagrangian Relaxation Approach to the Generalized Minimum Spanning Tree Problem, Mathematica, Tome 48(71), No. 2, pp. 191-201, 2006.
    6. 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.
    7. 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.
    8. 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.
    9. P.C. Pop, On some polynomial solvable cases of the generalized minimum spanning tree problem, Acta Universitatis Apulensis, No. 10, pp. 189-195, 2005.
    10. 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.
    11. 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.
    12. 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.
    13. P.C. Pop, The Generalized Minimum Spanning Tree Polytope and Related Polytopes, Memorandum No. 1587, University of Twente, the Netherlands, 2001.
    14. 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.
    15. 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.
    16. P.C. Pop, Optimal Maintenance of a Machine, Scientific Revue of the North University of Baia Mare, vol. XIII, pp. 131-138, 1997.

  4. Articole publicate in volumele conferintelor indexate in baze de date internationale:

    1. 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.
    2. 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.
    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. 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.
    5. 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.
    6. 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, pp. 109-117, 2004.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.

  5. Carti in edituri recunoscute international:

    1. P.C. Pop, The Generalized Minimum Spanning Tree Problem, PhD thesis, Twente University Press, Enschede, the Netherlands, 2002.
    2. P.C. Pop, Cercetari Operationale, RisoPrint, 2005.

© nnn Scream Design nnn