|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 9 keywords
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Petrica C. Pop, Oliviu Matei |
A Genetic Programming Approach for Solving the Linear Ordering Problem.  |
HAIS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Camelia-Mihaela Pintea, Corina Pop Sitar, Mara Hajdu-Macelaru, Petrica C. Pop |
A Hybrid Classical Approach to a Fixed-Charged Transportation Problem. |
HAIS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop, Serban Iordache |
A hybrid heuristic approach for solving the generalized traveling salesman problem. |
GECCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop, Oliviu Matei |
An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming. |
HAIS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop, Oliviu Matei, Honoriu Valean |
An Efficient Hybrid Soft Computing Approach to the Generalized Vehicle Routing Problem. |
SOCO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop, Oliviu Matei, Corina Pop Sitar, Camelia Chira |
A Genetic Algorithm for Solving the Generalized Vehicle Routing Problem. |
HAIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop, Oliviu Matei, C. Sabo |
A New Approach for Solving the Generalized Traveling Salesman Problem. |
Hybrid Metaheuristics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira, Dumitru Dumitrescu |
A Hybrid Ant-Based System for Gate Assignment Problem. |
HAIS |
2008 |
DBLP DOI BibTeX RDF |
constraints, assignment problems, ant algorithms, t-test |
| 1 | Camelia-Mihaela Pintea, Camelia Chira, D. Dumitrescu, Petrica C. Pop |
A Sensitive Metaheuristic for Solving a Large Optimization Problem. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop |
On the prize-collecting generalized minimum spanning tree problem. |
Annals OR |
2007 |
DBLP DOI BibTeX RDF |
Generalized minimum spanning tree problem, Combinatorial optimization, Minimum spanning trees, Linear relaxation |
| 1 | Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar |
An Ant-Based Heuristic for the Railway Traveling Salesman Problem. |
EvoWorkshops |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar, Dumitru Dumitrescu |
A Bio-Inspired Approach for a Dynamic Railway Problem. |
SYNASC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu |
Exact Algorithms for Generalized Combinatorial Optimization Problems. |
COCOA |
2007 |
DBLP DOI BibTeX RDF |
generalized combinatorial optimization problems, dynamic programming, exact algorithms |
| 1 | Petrica C. Pop, Walter Kern, Georg Still |
A new relaxation method for the generalized minimum spanning tree problem. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop, Georg Still, Walter Kern |
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. |
ACiD |
2005 |
DBLP BibTeX RDF |
|
| 1 | Petrica C. Pop |
New Models of the Generalized Minimum Spanning Tree Problem. |
J. Math. Model. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Georgia Hadjicharalambous, Petrica C. Pop, Evangelia Pyrga, George Tsaggouris, Christos D. Zaroliagis |
The Railway Traveling Salesman Problem. |
ATMOS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle |
Relaxation methods for the Generalized Minimum Spanning Tree Problem. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")