Metraipolis › archive › dc_e2fb46c0280f
P-curve: An improved solution for the single-facility location problem in two regions with $\ell_{p}$- and $\ell_{q}$-norms — arXiv:2610.01340
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01340
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:00:49.035Z
- SHA-256 of the archived text
9f023b61a0f5d5510808a66830669cd949bed90f787b27eec29704e0b4c67504- Stable URL of this page
https://metraipolis.com/documento/dc_e2fb46c0280f
How to cite
P-curve: An improved solution for the single-facility location problem in two regions with $\ell_{p}$- and $\ell_{q}$-norms — arXiv:2610.01340 — arXiv (en), https://arxiv.org/abs/2610.01340 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e2fb46c0280f (Metraipolis archive dc_e2fb46c0280f, sha256 9f023b61a0f5d5510808a66830669cd949bed90f787b27eec29704e0b4c67504)
BibTeX
@misc{dce2fb46c0280f,
title = {P-curve: An improved solution for the single-facility location problem in two regions with $ell_p$- and $ell_q$-norms — arXiv:2610.01340},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01340},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e2fb46c0280f; sha256 9f023b61a0f5d5510808a66830669cd949bed90f787b27eec29704e0b4c67504},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01340. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The distance between two points is provided by the length of their test connecting path. However, there is no unique way to attain this path in the space $R^2$, which is split by a straight line $L$ into two regions, $\Omega_p$ and $\Omega_q$, with $\ell_{p}$- and $\ell_q$-norms, respectively, where $1<p\leq q $ and $L\subset\Omega_q$. In this paper, given a point $P\in \Omega_p$, the locus of points $Q\in\Omega_p$, called $p$-curve, is found, such that there are two ways to attain the distance between $P$ and $Q$. For each $P\in \Omega_p$, there are two $p$-curves which are two branches of two different $p$-parabola. These two branches split $\Omega_p$ into three subregions using a three-link shortest path in two of these regions. The implicit equation of each $p$-parabola is given. Furthermore, by using the $p$-curve, an improved algorithm, called P-MFP, based on the MFP algorithm, is developed in order to solve the single-facility location problem in two regions with $\ell_{p}$ and $\ell_{q}$-norms. The results obtained with the new algorithm are better than those obtained with the MFP this http URL subheadings, citations, or equations are permitted.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.01340 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:14:57.962Z dalla pagina https://arxiv.org/catchup/math.OC/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).