References
- AkyüzMHÖncanTAltınelİKEfficient lower and upper bounds for the multi-commodity capacitated multi-facility weber problem with rectilinear distancesLogistik Management Systeme, Methoden, Integration2009229246
- AkyüzMHÖncanTAltınelİKThe multi-commodity capacitated multi-facility Weber problem: Heuristics and confidence intervalsIIE Trans20104282584110.1080/0740817X.2010.491504
- Akyüz MH, Öncan T and Altınel İK (2010b). Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. Research Paper No FBE-IE-02/2010-03, Institute for Graduate Studies in Science and Engineering, Boğaziçi University.
- Al-Loughani L (1997). Algorithmic approaches for solving the Euclidean distance location-allocation problems. PhD Thesis, Virginia Polytechnic Institute and State University, USA.
- AlpaydinEAltınelİKArasNParametric distance functions versus nonparametric neural networks for estimating road travel distancesEur J Opl Res199693223024310.1016/0377-2217(96)00045-8
- ArasNAltınelİKOrbayMNew heuristic methods for the capacitated multi-facility Weber problemNav Res Log200754213210.1002/nav.20176
- ArasNOrbayMAltınelİKEfficient heuristics for the rectilinear distance capacitated multi-facility Weber problemJ Opl Res Soc200859647910.1057/palgrave.jors.2602262
- BrimbergJLoveRFGlobal convergence of a generalized iterative procedure for the minisum location problem with lp distancesOpns Res1993411153116310.1287/opre.41.6.1153
- BrimbergJChenRChenDAccelerating convergence in the Fermat-Weber location problemOpns Res19982215115710.1016/S0167-6377(98)00016-9
- BrimbergJWalkerJHLoveRFEstimation of travel distances with the weighted lp norm: Some empirical resultsJ. Transp Geogr2007151627210.1016/j.jtrangeo.2006.01.004
- ChenPHansenPJaumardBTuyHSolution of the multisource Weber and conditional Weber problems by D.C. programmingOpns Res199846454856210.1287/opre.46.4.548
- CooperLHeuristic methods for location-allocation problemsSIAM Rev19646375310.1137/1006005
- CooperLThe transportation-location problemOpns Res1972209410810.1287/opre.20.1.94
- DreznerZThe planar two-center and two-median problemsTrans Sci198418435236110.1287/trsc.18.4.351
- DreznerZMehrezAWesolowskyGOThe facility location problem with limited distancesTrans Sci199125318318710.1287/trsc.25.3.183
- FisherRATippettLHCLimiting forms of the frequency distribution of the largest or smallest member of a sampleProc Cambridge Philosoph Soc19282418019010.1017/S0305004100015681
- FrenkJBGMeloMTZhangSA Weiszfeld method for acgeneralized lp distance minisum location model in continuous spaceLocation Sci19942111117
- HansenPPerreurJThisseJFLocation theory, dominance and convexity: Some further resultsOpns Res19802851241125010.1287/opre.28.5.1241
- HansenPMladenovicNTaillardEHeuristic solution of the multisource Weber problem as a p-median problemOpns Res Lett199822556210.1016/S0167-6377(98)00004-2
- IdrissiHLoridanPMichelotCApproximation of solutions for location problemsJ Optim Theory Appl19885612714310.1007/BF00938529
- KlingmanDNapierAStutzJNETGEN: A program for generating large scale capacitated assignment, transportation, and minimum cost flow network problemsMngt Sci19742081482110.1287/mnsc.20.5.814
- Krau S (1997). Extensions du probleme de Weber. PhD Thesis, University of Montreal.
- LuisMSalhiSNagyGRegion-rejection based heuristics for the capacitated multi-source Weber problemComput Opns Res2009362007201710.1016/j.cor.2008.06.012
- MegiddoNSupowitKJOn the complexity of some common geometric location problemsSIAM J Comput198413118219610.1137/0213014
- PolyakBTA general method of solving extremum problemsSoviet Math Dokl19678593597
- PolyakBTMinimization of unsmooth functionalsUSSR Comput Math Math Phys196993142910.1016/0041-5553(69)90061-5
- RighiniGZaniboniLA branch-and-price algorithm for the multi-source Weber problemInt J Opns Res20072218820710.1504/IJOR.2007.012460
- RosingKEAn optimal method for solving the (generalized) multi-Weber problemEur J Opl Res19925841442610.1016/0377-2217(92)90072-H
- RosingKEReVelleCSHeuristic concentration: Two stage solution constructionEur J Opl Res199797758610.1016/S0377-2217(96)00100-2
- Selim S (1979). Biconvex programming and deterministic and stochastic location allocation problems. PhD Thesis, Georgia Institute of Technology, USA.
- SheraliHDAdamsWPA Reformulation-linearization Technique for Solving Discrete and Continuous Nonconvex Problems1999
- SheraliHDTunçbilekCHA squared-Euclidean distance location-allocation problemNav Res Log199239444746910.1002/1520-6750(199206)39:4<447::AID-NAV3220390403>3.0.CO;2-O
- SheraliHDRamachandranSKimSIA localization and reformulation discrete programming approach for the rectilinear distance location-allocation problemsDisc Appl Math1994491–335737810.1016/0166-218X(94)90218-6
- SheraliHDAl-LoughaniISubramanianSGlobal optimization procedures for the capacitated Euclidean and ℓp distance multifacility location-allocation problemsOpns Res200250343344810.1287/opre.50.3.433.7739
- ThisseJFWardJEWendellRESome properties of location problems with block and round normsOpns Res19843261309132710.1287/opre.32.6.1309
- WardJEWendellREA new norm for measuring distance which yields linear location problemsOpns Res198028383684410.1287/opre.28.3.836
- WardJEWendellREUsing block norms for location modelingOpns Res19853351074109010.1287/opre.33.5.1074
- WeiszfeldESur le point lequel la somme des distances de n points donnes est minimumTôhoku Math J193743355386
- WendellREHurterAPLocation theory, dominance and convexityOpns Res19732131432010.1287/opre.21.1.314
- Witzgall C (1964). Optimal location of central facility: Mathematical models and concepts. National Bureau of Standards, Report No. 8388.
- ZainuddinZMSalhiSA perturbation-based heuristic for the capacitated multisource Weber problemEur J Opl Res20071791194120710.1016/j.ejor.2005.09.050