#### Filter Results:

#### Publication Year

1989

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Petrica C. Pop
- 2002

We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard. We introduce a new mixed integer programming formulation of the problem which contains a polynomial number of constraints and a polynomial number of variables. Based on this formulation we give an… (More)

- Petrica C. Pop, Walter Kern, Georg Still
- European Journal of Operational Research
- 2006

- Camelia-Mihaela Pintea, Petrica C. Pop, Camelia Chira
- ArXiv
- 2013

A well known N P-hard problem called the Generalized Traveling Salesman Problem (GTSP) is considered. In GTSP the nodes of a complete undirected graph are partitioned into clusters. The objective is to find a minimum cost tour passing through exactly one node from each cluster. An exact exponential time algorithm and an effective meta-heuristic algorithm… (More)

- Petrica C. Pop
- J. Math. Model. Algorithms
- 2004

We consider the Railway Traveling Salesman Problem (RTSP) in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having as goal to minimize the overall time of the journey. RTSP is an N P-hard problem. Although it is related to the Generalized… (More)

- Petrica C. Pop, Serban Iordache
- GECCO
- 2011

The generalized traveling salesman problem (GTSP) is an NP-hard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking for a minimum Hamiltonian tour visiting exactly one node from each cluster. In this paper, we combine the consultant-guided search technique with a local-global approach in order to… (More)

- Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu
- COCOA
- 2007

- Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar
- EvoWorkshops
- 2007

- Petrica C. Pop, Georg Still, Walter Kern
- ACiD
- 2005

Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster. It is known that the GMST problem is NP-hard and even finding a near optimal solution is NP-hard. We give an… (More)