The maximin line problem with regional demand
From MaRDI portal
Publication:872234
DOI10.1016/j.ejor.2006.06.013zbMath1178.90216OpenAlexW2095369913MaRDI QIDQ872234
José-Miguel Díaz-Báñez, Pilar Sabariego, Pedro A. Ramos
Publication date: 27 March 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.013
Optimality conditions and duality in mathematical programming (90C46) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete location and assignment (90B80)
Related Items (4)
The maximin HAZMAT routing problem ⋮ LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS ⋮ THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS ⋮ Location of weighted anti-ordered median straight lines with Euclidean distances
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric search made practical
- Shortest paths in the plane with convex polygonal obstacles
- Geometric complexity of some location problems
- Topologically sweeping an arrangement
- Linear facility location. Solving extensions of the basic problem
- Multicriteria planar location problems
- The Weber problem with regional demand
- Continuous location of dimensional structures.
- Locating an obnoxious plane
- Computing obnoxious 1-corner polygonal chains
- Location of an Obnoxious Route
- Linear Facility Location in Three Dimensions—Models and Solution Methods
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Parallel Merge Sort
- Computing the width of a set
- Ray Shooting Amidst Convex Polygons in 2D
- Dynamic Trees and Dynamic Point Location
- An Approach to Location Models Involving Sets as Existing Facilities
- Locating facilities by minimax relative to closest points of demand areas
This page was built for publication: The maximin line problem with regional demand
