#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1971

2017

- This year (3)
- Last 5 years (36)
- Last 10 years (56)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### 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
- J. Math. Model. Algorithms
- 2004

Weconsider theRailwayTravelingSalesmanProblem (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 NP-hard problem. Although it is related to the Generalized Asymmetric… (More)

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

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

- 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)

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

Background Many combinatorial optimization problems are NP-hard, and the theory of NP-completeness has reduced hopes that NP-hard problems can be solved within polynomially bounded computation times (Dahlke 2008; Dunne 2008). Nevertheless, sub-optimal solutions are sometimes easy to find. Consequently, there is much interest in approximation and heuristic… (More)

- Oliviu Matei, Petrica C. Pop
- Proceedings of the 2010 IEEE 6th International…
- 2010

The generalized traveling salesman problem (GTSP) is a generalization of the classical traveling salesman problem. The GTSP is known to be an NP-hard problem and has many interesting applications. In this paper we present a local-global approach for the generalized traveling salesman problem and as well an efficient algorithm for solving the problem based… (More)

- Petrica C. Pop, Oliviu Matei
- LION
- 2013

This paper addresses the problem of partitioning a set of vectors into two subsets such that the sums per every coordinate should be exactly or approximately equal. This problem, introduced by Kojic [7], is called the multidimensional two-way number partitioning problem (MDTWNPP) and generalizes the classical two-way number partitioning problem. We propose… (More)