| 2008 |
|---|
| 10 | EE | Camelia-Mihaela Pintea,
Petrica C. Pop,
Camelia Chira,
Dumitru Dumitrescu:
A Hybrid Ant-Based System for Gate Assignment Problem.
HAIS 2008: 273-280 |
| 9 | EE | Camelia-Mihaela Pintea,
Camelia Chira,
D. Dumitrescu,
Petrica C. Pop:
A Sensitive Metaheuristic for Solving a Large Optimization Problem.
SOFSEM 2008: 551-559 |
| 2007 |
|---|
| 8 | EE | Petrica C. Pop,
Corina Pop Sitar,
Ioana Zelina,
Ioana Tascu:
Exact Algorithms for Generalized Combinatorial Optimization Problems.
COCOA 2007: 154-162 |
| 7 | EE | Petrica C. Pop,
Camelia-Mihaela Pintea,
Corina Pop Sitar:
An Ant-Based Heuristic for the Railway Traveling Salesman Problem.
EvoWorkshops 2007: 702-711 |
| 6 | EE | Petrica C. Pop,
Camelia-Mihaela Pintea,
Corina Pop Sitar,
Dumitru Dumitrescu:
A Bio-Inspired Approach for a Dynamic Railway Problem.
SYNASC 2007: 449-452 |
| 5 | EE | Petrica C. Pop:
On the prize-collecting generalized minimum spanning tree problem.
Annals OR 150(1): 193-204 (2007) |
| 2006 |
|---|
| 4 | EE | 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 |
|---|
| 3 | | 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 |
|---|
| 2 | EE | Georgia Hadjicharalambous,
Petrica C. Pop,
Evangelia Pyrga,
George Tsaggouris,
Christos D. Zaroliagis:
The Railway Traveling Salesman Problem.
ATMOS 2004: 264-275 |
| 2001 |
|---|
| 1 | EE | 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) |
