OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
From MaRDI portal
Publication:4762912
Recommendations
- scientific article; zbMATH DE number 2185624
- The Facility Location Problem with Limited Distances
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- An O\((n \log{}n)\) algorithm for a maxmin location problem
- An Algorithm for the p-Center Problem in the Plane
Cites work
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Adding range restriction capability to dynamic data structures
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Efficient Algorithms for the Capacitated 1-Median Problem
- Filtering Search: A New Approach to Query-Answering
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- New Parallel-Sorting Schemes
- New Results on the Complexity of p-Centre Problems
- Slowing down sorting networks to obtain faster sorting algorithms
- The single facility location problem with minimum distance constraints
Cited in
(27)- Degree of locational freedom in a single facility euclidean minimax location model
- Locating two obnoxious facilities using the weighted maximin criterion
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- A single facility location problem with a weighted maximin-minimax rectilinear distance
- Facility location problems in the plane based on reverse nearest neighbor queries
- Line facility location in weighted regions
- Parametric analysis of optimal facility locations
- Multi-dimensional dynamic facility location and fast computation at query points
- An Algorithm for the Single Facility Location Problem Using the Jaccard Metric
- New variations of the maximum coverage facility location problem
- Linear facility location. Solving extensions of the basic problem
- New algorithms for 1-D facility location and path equipartition problems
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane
- Extensions to the Weber problem
- Minimax location with farthest Euclidean distances
- scientific article; zbMATH DE number 776093 (Why is no real title available?)
- Location optimization
- Improved algorithms for placing undesirable facilities
- Geographically optimal similarity
- Establishing Continuity of Certain Optimal Parametric Facility Location Trajectories
- The single facility location problem with average-distances
- Algorithmic results for ordered median problems
- scientific article; zbMATH DE number 2185624 (Why is no real title available?)
- Constant work-space algorithms for facility location problems
- Finding an Euclidean anti-\(k\)-centrum location of a set of points
- New algorithms for facility location problems on the real line
- Kantorovich-Rubinstein distance minimization: application to location problems
This page was built for publication: OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4762912)
