Pasting gauges. I: Shortest paths across a hyperplane
From MaRDI portal
Publication:1728102
DOI10.1016/j.dam.2018.10.037zbMath1447.52027OpenAlexW2904307221WikidataQ128780967 ScholiaQ128780967MaRDI QIDQ1728102
Publication date: 21 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.037
Norms (inequalities, more than one norm, etc.) of linear operators (47A30) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items (4)
Rejoinder on: ``Distance geometry and data science ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ Pasting gauges. II: Balls in pasted halfplanes ⋮ Fixed gate point location problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized Weber problem with different gauges for different regions
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- Gate points in continuous location between regions with different \(\ell _{p}\) norms
- Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
- Continuous location under the effect of `refraction'
- A destination optimality in asymmetric distance Fermat-Weber problems
- Lower subdifferentiable functions and their minimization by cutting planes
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- Location among regions with varying norms
- Pasting gauges. II: Balls in pasted halfplanes
- Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line
- Movement planning in the presence of flows
- A BSSS algorithm for the single facility location problem in two regions with different norms
- Introduction to nonlinear and global optimization
- Querying Approximate Shortest Paths in Anisotropic Regions
- Euclidean Shortest Paths
- The Cutting-Plane Method for Solving Convex Programs
- Determining approximate shortest paths on weighted polyhedral surfaces
- Approximate Shortest Paths in Anisotropic Regions
- Single facility location problem with region-dependent distance metrics
- The weighted region problem
- On finding approximate optimal paths in weighted regions
- LOCATING A SINGLE FACILITY IN THE PLANE IN THE PRESENCE OF A BOUNDED REGION AND DIFFERENT NORMS
- Gauge distances and median hyperplanes
This page was built for publication: Pasting gauges. I: Shortest paths across a hyperplane
