Cross-monotonic cost sharing methods for connected facility location gamesLEONARDI, Stefano; SCHÄFER, Guido.Theoretical computer science. 2004, Vol 326, Num 1-3, pp 431-442, issn 0304-3975, 12 p.Article

Solution methods for the p-median problem : An annotated bibliographyREESE, J.Networks (New York, NY). 2006, Vol 48, Num 3, pp 125-142, issn 0028-3045, 18 p.Article

A large-scale application of the partial coverage uncapacitated facility location problemVASKO, F. J; NEWHART, D. D; STOTT, K. L et al.The Journal of the Operational Research Society. 2003, Vol 54, Num 1, pp 11-20, issn 0160-5682, 10 p.Article

The minimum equitable radius location problem with continuous demandSUZUKI, Atsuo; DREZNER, Zvi.European journal of operational research. 2009, Vol 195, Num 1, pp 17-30, issn 0377-2217, 14 p.Article

An efficient algorithm for the uncapacitated facility location problem with totally balanced matrixBERESNEV, V. L.Discrete applied mathematics. 2001, Vol 114, Num 1-3, pp 13-22, issn 0166-218XArticle

Accelerating convergence in minisum location problem with ℓ_p normsVALERO-FRANCO, C; RODRÍGUEZ-CHÍA, A. M; ESPEJO, I et al.Computers & operations research. 2013, Vol 40, Num 11, pp 2770-2785, issn 0305-0548, 16 p.Article

Multiple criteria facility location problems: A surveyREZA ZANJIRANI FARAHANI; STEADIESEIFI, Maryam; ASGARI, Nasrin et al.Applied mathematical modelling. 2010, Vol 34, Num 7, pp 1689-1709, issn 0307-904X, 21 p.Article

Dynamic multi-commodity capacitated facility location : a mathematical modeling framework for strategic supply chain planningMELO, M. T; NICKEL, S; DA GAMA, F. Saldanha et al.Computers & operations research. 2006, Vol 33, Num 1, pp 181-208, issn 0305-0548, 28 p.Article

Computing obnoxious 1-comer polygonal chainsDIAZ-BANEZ, J. M; HURTADO, F.Computers & operations research. 2006, Vol 33, Num 4, pp 1117-1128, issn 0305-0548, 12 p.Article

Facility location in a global viewWENQIANG DAI; PENG XIAO; KE JIANG et al.Lecture notes in computer science. 2005, pp 142-150, issn 0302-9743, isbn 3-540-26224-5, 9 p.Conference Paper

Facility location and the geometric minimum-diameter spanning treeGUDMUNDSSON, Joachim; HAVERKORT, Herman; PARK, Sang-Min et al.Lecture notes in computer science. 2002, pp 146-160, issn 0302-9743, isbn 3-540-44186-7, 15 p.Conference Paper

Locating a competitive facility in the plane with a robustness criterionBLANQUERO, R; CARRIZOSA, E; HENDRIX, E. M. T et al.European journal of operational research. 2011, Vol 215, Num 1, pp 21-24, issn 0377-2217, 4 p.Article

The multi-facility median problem with Pos/Neg weights on general graphsKALCSICS, Jörg.Computers & operations research. 2011, Vol 38, Num 3, pp 674-682, issn 0305-0548, 9 p.Article

Location of a facility minimizing nuisance to or from a planar networkDREZNER, Tammy; DREZNER, Zvi; SCOTT, Canton H et al.Computers & operations research. 2009, Vol 36, Num 1, pp 135-148, issn 0305-0548, 14 p.Article

Undesirable facility location problems on multicriteria networksCOLEBROOK, Marcos; SICILIA, Joaquin.Computers & operations research. 2007, Vol 34, Num 5, pp 1491-1514, issn 0305-0548, 24 p.Article

LP-based approximation algorithms for capacitated facility locationLEVI, Retsef; SHMOYS, David B; SWAMY, Chaitanya et al.Lecture notes in computer science. 2004, pp 206-218, issn 0302-9743, isbn 3-540-22113-1, 13 p.Conference Paper

Modelling lost demand in competitive facility locationDREZNER, T; DREZNER, Z.The Journal of the Operational Research Society. 2012, Vol 63, Num 2, pp 201-206, issn 0160-5682, 6 p.Article

Multiple voting location problemsCAMPOS RODRIGUEZ, Clara M; PEREZ, José A. Moreno.European journal of operational research. 2008, Vol 191, Num 2, pp 436-452, issn 0377-2217, 17 p.Article

Memoryless facility location in one passFOTAKIS, Dimitris.Lecture notes in computer science. 2006, pp 608-620, issn 0302-9743, isbn 3-540-32301-5, 1Vol, 13 p.Conference Paper

Computing all large sums-of-pairs in Rⁿ and the discrete planar two-watchtower problemBEN-MOSHE, Boaz; CARMI, Paz; KATZ, Matthew J et al.Information processing letters. 2004, Vol 89, Num 3, pp 137-139, issn 0020-0190, 3 p.Article

Hard cases of the multifacility location problemKARZANOV, Alexander V.Discrete applied mathematics. 2004, Vol 143, Num 1-3, pp 368-373, issn 0166-218X, 6 p.Article

Improved approximation algorithms for the uncapacitated facility location problemCHUDAK, Fabian A; SHMOYS, David B.SIAM journal on computing (Print). 2004, Vol 33, Num 1, pp 1-25, issn 0097-5397, 25 p.Article

Drag Reduction Using Riblet Film Applied to Airfoils for Wind TurbinesSAREEN, Agrim; DETERS, Robert W; HENRY, Steven P et al.Journal of solar energy engineering. 2014, Vol 136, Num 2, issn 0199-6231, 021007.1-021007.8Article

Fast bounding procedures for large instances of the Simple Plant Location ProblemLETCHFORD, Adam N; MILLER, Sebastian J.Computers & operations research. 2012, Vol 39, Num 5, pp 985-990, issn 0305-0548, 6 p.Article

An approximation algorithm for the k-Level Concentrator Location ProblemDREXL, Moritz A.Operations research letters. 2011, Vol 39, Num 5, pp 355-358, issn 0167-6377, 4 p.Article