The Constrained 2-Maxian Problem on Cycles

Chunsong Bai () and Jun Du
Additional contact information
Chunsong Bai: School of Finance and Mathematics, Huainan Normal University, Huainan 232038, China
Jun Du: School of Finance and Mathematics, Huainan Normal University, Huainan 232038, China

Mathematics, 2024, vol. 12, issue 6, 1-9

Abstract: This paper deals with p -maxian problem on cycles with an upper bound on the distances of all facilities. We consider the case of p = 2 and show that, in the worst case, the optimal solution contains at least one vertex of the underlying cycle, which helps to develop an efficient algorithm to solve the constrained 2-maxian problem. Based on this property, we develop a linear time algorithm for the constrained 2-maxian problem on a cycle. We also discuss the relations between the constrained and unconstrained 2-maxian problems on which the underlying graphs are cycles.

Keywords: location problem; maxian problem; cycle; convex (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/6/876/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/6/876/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:6:p:876-:d:1358266

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().