LOCATION ON NETWORKS: A SURVEY. I: THE P-CENTER AND P-MEDIAN PROBLEMSTANSEL BC; FRANCIS RL; LOWE TJ et al.1983; MANAGEMENT SCIENCE; ISSN 0025-1909; USA; DA. 1983; VOL. 29; NO 4; PP. 482-497Article

A vertex-closing approach to the p-center problemMARTINICH, J. S.Naval research logistics. 1988, Vol 35, Num 2, pp 185-201, issn 0894-069XArticle

On the rectangular p-center problemDREZNER, Z.Naval research logistics. 1987, Vol 34, Num 2, pp 229-234, issn 0894-069XArticle

On a generalization of the p-Center ProblemKRUMKE, S. O.Information processing letters. 1995, Vol 56, Num 2, pp 67-71, issn 0020-0190Article

New results on the complexity of p-center problemsMEGIDDO, N; TAMIR, A.SIAM journal on computing (Print). 1983, Vol 12, Num 4, pp 751-758, issn 0097-5397Article

A relaxation-based algorithm for solving the conditional p-center problemDORON CHEN; REUVEN CHEN.Operations research letters. 2010, Vol 38, Num 3, pp 215-217, issn 0167-6377, 3 p.Article

A finite algorithm for the continuous p-center location problem on a graphTAMIR, A.Mathematical programming. 1985, Vol 31, Num 3, pp 298-306, issn 0025-5610Article

New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problemsCHEN, Doron; CHEN, Reuven.Computers & operations research. 2009, Vol 36, Num 5, pp 1646-1655, issn 0305-0548, 10 p.Article

New heuristic algorithms for the rectangular p-cover problemPELEGRIN, B; CANOVAS, L.RAIRO. Recherche opérationnelle. 1995, Vol 29, Num 1, pp 73-91, issn 0399-0559Article

THE P-CENTER PROBLEM IN THE PLANE IS NP-COMPLETEMARCHETTI SPACCAMELA A.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 19/1981/MONTICELLO IL; USA; DA. S.D.; PP. 31-40; BIBL. 4 REF.Conference Paper

A distance constrained p-facility location problem on the real lineTAMIR, A.Mathematical programming. 1994, Vol 66, Num 2, pp 201-204, issn 0025-5610Article

A new formulation for the conditional p-median and p-center problemsBERMAN, Oded; DREZNER, Zvi.Operations research letters. 2008, Vol 36, Num 4, pp 481-483, issn 0167-6377, 3 p.Article

An improved algorithm for the p-center problem on interval graphs with unit lengthsCHENG, T. C. E; LIYING KANG; NG, C. T et al.Computers & operations research. 2007, Vol 34, Num 8, pp 2215-2222, issn 0305-0548, 8 p.Article

Heuristic methods for the p-center problemPELEGRIN, B.RAIRO. Recherche opérationnelle. 1991, Vol 25, Num 1, pp 65-72, issn 0399-0559, 8 p.Article

Lagrangean duals and exact solution to the capacitated p-center problemALBAREDA-SAMBOLA, Maria; DIAZ, Juan A; FERNANDEZ, Elena et al.European journal of operational research. 2010, Vol 201, Num 1, pp 71-81, issn 0377-2217, 11 p.Article

Insertion Heuristics for Central Cycle ProblemsLAMB, John D.Networks (New York, NY). 2010, Vol 56, Num 1, pp 70-80, issn 0028-3045, 11 p.Article

Star p-hub center problem and star p-hub median problem with bounded path lengthsYAMAN, Hande; ELLOUMI, Sourour.Computers & operations research. 2012, Vol 39, Num 11, pp 2725-2732, issn 0305-0548, 8 p.Article

Bee colony optimization for the p-center problemDAVIDOVIC, Tatjana; RAMLJAK, Dušan; SELMIC, Milica et al.Computers & operations research. 2011, Vol 38, Num 10, pp 1367-1376, issn 0305-0548, 10 p.Article

Double bound method for solving the p-center location problemCALIK, Hatice; TANSEL, Barbaros C.Computers & operations research. 2013, Vol 40, Num 12, pp 2991-2999, issn 0305-0548, 9 p.Article

The stochastic p-hub center problem with service-level constraints : New developments on hub locationSIM, Thaddeus; LOWE, Timothy J; THOMAS, Barrett W et al.Computers & operations research. 2009, Vol 36, Num 12, pp 3166-3177, issn 0305-0548, 12 p.Article

Minimizing the maximum travel time in a combined model of facility location and network designCONTRERAS, Ivan; FERNANDEZ, Elena; REINELT, Gerhard et al.Omega (Oxford). 2012, Vol 40, Num 6, pp 847-860, issn 0305-0483, 14 p.Article

A 2-phase algorithm for solving the single allocation p-hub center problem : New developments on hub locationMEYER, T; ERNST, A. T; KRISHNAMOORTHY, M et al.Computers & operations research. 2009, Vol 36, Num 12, pp 3143-3151, issn 0305-0548, 9 p.Article

Uncapacitated single and multiple allocation p-hub center problemsERNST, Andreas T; HAMACHER, Horst; HOUYUAN JIANG et al.Computers & operations research. 2009, Vol 36, Num 7, pp 2230-2241, issn 0305-0548, 12 p.Article