Petrica C. Pop Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Oliviu Matei, Corina Pop Sitar: An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109: 76-83 (2013)
2012
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Oliviu Matei: A Genetic Programming Approach for Solving the Linear Ordering Problem. HAIS (2) 2012: 331-338
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Camelia-Mihaela Pintea, Corina Pop Sitar, Mara Hajdu-Macelaru, Petrica C. Pop: A Hybrid Classical Approach to a Fixed-Charged Transportation Problem. HAIS (1) 2012: 557-566
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Oliviu Matei, Petrica C. Pop, Honoriu Valean: A Robust Approach to Digit Recognition in Noisy Environments. IEA/AIE 2012: 606-615
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Camelia-Mihaela Pintea, Petrica C. Pop: Sensor Networks Security Based on Sensitive Robots Agents: A Conceptual Model. CISIS/ICEUTE/SOCO Special Sessions 2012: 47-56
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Camelia-Mihaela Pintea, Petrica C. Pop, Mara Hajdu-Macelaru: Classical Hybrid Approaches on a Transportation Problem with Gas Emissions Constraints. SOCO 2012: 449-458
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop: Sensitive Ants in Solving the Generalized Vehicle Routing Problem. CoRR abs/1208.5341 (2012)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Camelia-Mihaela Pintea, Petrica C. Pop: Sensor networks security based on sensitive robots agents. A conceptual model. CoRR abs/1210.7422 (2012)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Camelia-Mihaela Pintea, Petrica C. Pop, Mara Hajdu-Macelaru: Classical hybrid approaches on a transportation problem with gas emissions constraints. CoRR abs/1211.3218 (2012)
2011
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Serban Iordache: A hybrid heuristic approach for solving the generalized traveling salesman problem. GECCO 2011: 481-488
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Oliviu Matei: An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming. HAIS (2) 2011: 67-74
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Oliviu Matei, Honoriu Valean: An Efficient Hybrid Soft Computing Approach to the Generalized Vehicle Routing Problem. SOCO 2011: 281-289
2010
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Oliviu Matei, Corina Pop Sitar, Camelia Chira: A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem. HAIS (2) 2010: 119-126
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Oliviu Matei, C. Sabo: A New Approach for Solving the Generalized Traveling Salesman Problem. Hybrid Metaheuristics 2010: 62-72
2008
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira, Dumitru Dumitrescu: A Hybrid Ant-Based System for Gate Assignment Problem. HAIS 2008: 273-280
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop: A Sensitive Metaheuristic for Solving a Large Optimization Problem. SOFSEM 2008: 551-559
2007
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop: On the prize-collecting generalized minimum spanning tree problem. Annals OR 150(1): 193-204 (2007)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu: Exact Algorithms for Generalized Combinatorial Optimization Problems. COCOA 2007: 154-162
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar: An Ant-Based Heuristic for the Railway Traveling Salesman Problem. EvoWorkshops 2007: 702-711
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar, Dumitru Dumitrescu: A Bio-Inspired Approach for a Dynamic Railway Problem. SYNASC 2007: 449-452
2006
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Walter Kern, Georg Still: A new relaxation method for the generalized minimum spanning tree problem. European Journal of Operational Research 170(3): 900-908 (2006)
2005
c2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Georg Still, Walter Kern: An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. ACiD 2005: 115-121
2004
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop: New Models of the Generalized Minimum Spanning Tree Problem. J. Math. Model. Algorithms 3(2): 153-166 (2004)
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Georgia Hadjicharalambous, Petrica C. Pop, Evangelia Pyrga, George Tsaggouris, Christos D. Zaroliagis: The Railway Traveling Salesman Problem. ATMOS 2004: 264-275
2001
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle: Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electronic Notes in Discrete Mathematics 8: 76-79 (2001)

Coauthor Index

1Camelia Chira
[i3] [c9] [c7] [c6]
2Dumitru Dumitrescu (D. Dumitrescu)
[i3] [c7] [c6] [c3]
3Ulrich Faigle
[j1]
4Georgia Hadjicharalambous
[c1]
5Mara Hajdu-Macelaru
[c16] [c13] [i1]
6Serban Iordache
[c12]
7Walter Kern
[j3] [c2] [j1]
8Oliviu Matei
[j5] [c17] [c15] [c11] [c10] [c9] [c8]
9Camelia-Mihaela Pintea
[c16] [c14] [c13] [i3] [i2] [i1] [c7] [c6] [c4] [c3]
10Evangelia Pyrga
[c1]
11C. Sabo
[c8]
12Corina Pop Sitar
[j5] [c16] [c9] [c5] [c4] [c3]
13Georg Still (Georg J. Still)
[j3] [c2] [j1]
14Ioana Tascu
[c5]
15George Tsaggouris
[c1]
16Honoriu Valean
[c15] [c10]
17Christos D. Zaroliagis
[c1]
18Ioana Zelina
[c5]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Tue May 21 09:54:41 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page