The rectilinear distance Weber problem in the presence of a probabilistic line barrier
Authors:
- Mustafa S. CanbolatMCMustafa S. Canbolat
- George O. WesolowskyGWGeorge O. Wesolowsky
- 1 April 2010
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 202 (1) , 114-121
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- An efficient solution method for Weber problems with barriers based on genetic algorithmsEuropean Journal of Operational Research, 2007
- Planar Location Problems with Block Distance and BarriersAnnals of Operations Research, 2005
- A Wavefront Approach to Center Location Problems with BarriersAnnals of Operations Research, 2005
- Dominating sets for rectilinear center location problems with polyhedral barriersNaval Research Logistics (NRL), 2002
- Solving Rectilinear Planar Location Problems with Barriers by a Polynomial PartitioningAnnals of Operations Research, 2002
- An Equivalence Result for Single Facility Planar Location Problems with Rectilinear Distance and BarriersAnnals of Operations Research, 2002
- Planar Weber location problems with barriers and block normsAnnals of Operations Research, 2000
- An efficient algorithm for facility location in the presence of forbidden regionsEuropean Journal of Operational Research, 1996
- Restricted planar location problems and applicationsNaval Research Logistics (NRL), 1995
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to TravelTransportation Science, 1994