Fixed gate point location problems
From MaRDI portal
Publication:1979181
DOI10.1007/S11750-020-00551-4zbMATH Open1471.90085OpenAlexW3048029567MaRDI QIDQ1979181FDOQ1979181
Authors: Marco Botte 
Publication date: 2 September 2021
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-020-00551-4
Recommendations
- Facility location in the phylogenetic tree space
- Single-facility location problems in two regions with \(\ell_{1}\)- and \(\ell_q\)-norms separated by a straight line
- A flexible approach to location problems
- Four-point Fermat location problems revisited. New proofs and extensions of old results
- scientific article; zbMATH DE number 1803754
Cites Work
- Geometry of the space of phylogenetic trees
- A note on Fermat's problem
- Second-order cone programming
- Location among regions with varying norms
- A BSSS algorithm for the single facility location problem in two regions with different norms
- Single facility location problem with region-dependent distance metrics
- Computing geodesic distances in tree space
- The weighted region problem
- Weber problems with alternative transportation systems
- Title not available (Why is that?)
- Gate points in continuous location between regions with different \(\ell _{p}\) norms
- LOCATING A SINGLE FACILITY IN THE PLANE IN THE PRESENCE OF A BOUNDED REGION AND DIFFERENT NORMS
- Continuous location under the effect of `refraction'
- Finding a core of a tree with pos/neg weight
- On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
- Pasting gauges. I: Shortest paths across a hyperplane
Cited In (2)
This page was built for publication: Fixed gate point location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979181)
