A planar single facility location and border crossing problem
From MaRDI portal
Publication:339663
DOI10.1016/j.cor.2012.04.002zbMath1349.90558OpenAlexW1978653041MaRDI QIDQ339663
George O. Wesolowsky, Mustafa S. Canbolat
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.002
optimizationouter approximationbarriers to travelmixed integer nonlinear programmingborder crossingpassage pointsplanar facility location
Related Items (2)
A generalized Weber problem with different gauges for different regions ⋮ A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A wavefront approach to center location problems with barriers
- Planar location problems with block distance and barriers
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- Placing a finite size facility with a center objective on a rectangular plane with barriers
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- An efficient algorithm for facility location in the presence of forbidden regions
- Locating a 1-center on a Manhattan plane with ``arbitrarily shaped barriers
- Algebraic properties of location problems with one circular barrier.
- BARON: A general purpose global optimization software package
- Linearization of mixed-integer products
- Planar weber location problems with line barriers
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Using Block Norms for Location Modeling
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- A reduction result for location problems with polyhedral barriers
This page was built for publication: A planar single facility location and border crossing problem
