A multifacility location problem on median spaces
From MaRDI portal
Publication:1917237
DOI10.1016/0166-218X(95)00115-8zbMath0846.90064MaRDI QIDQ1917237
Publication date: 7 July 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
networkspolynomial algorithmmedian graphsminimum-cut problemsvertex-restricted multifacility location problemweighted sum of distances
Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Related Items
Hard cases of the multifacility location problem ⋮ On condorcet and median points of simple rectilinear polygons ⋮ One more well-solved case of the multifacility location problem ⋮ Unnamed Item ⋮ Discrete Convex Functions on Graphs and Their Algorithmic Applications ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Minimum 0-extension problems on directed metrics ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ Determination of \(\text{msd}(L^n)\)
Cites Work
- Medians in median graphs
- Matching binary convexities
- On rectilinear link distance
- Gated sets in metric spaces
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
- On the use of ordered sets in problems of comparison and consensus of classifications
- Rectilinear shortest paths in the presence of rectangular barriers
- Geometric interpretation of the optimality conditions in multifacility location and applications
- The median procedure in cluster analysis and social choice theory
- Triangulating a simple polygon in linear time
- Parallel rectilinear shortest paths with rectangular obstacles
- Computing a median point of a simple rectilinear polygon
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Median algebras
- A data structure for dynamic trees
- Graphs of acyclic cubical complexes
- Distance-preserving subgraphs of hypercubes
- Metric Ternary Distributive Semi-Lattices
- A Formal Theory of Consensus
- An Algorithm for a Constrained Weber Problem
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Optimal Point Location in a Monotone Subdivision
- The Euclidean Multifacility Location Problem
- Solving nonlinear multiple-facility network location problems
- Effective algorithm for the weber problem with a rectangular metric
- Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach
- Median Algebra
- Optimal Search in Planar Subdivisions
- SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
- Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming
- Convex Location Problems on Tree Networks
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
- Medians, Lattices, and Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
