Inverse Vertex/Absolute Quickest 1-Center Location Problem on a Tree Under Weighted $$l_1$$ l 1 Norm

Xinqiang Qian, Xiucui Guan (), Junhua Jia and Panos M. Pardalos
Additional contact information
Xinqiang Qian: Southeast University
Xiucui Guan: Southeast University
Junhua Jia: Southeast University
Panos M. Pardalos: University of Florida

Journal of Optimization Theory and Applications, 2024, vol. 200, issue 2, No 4, 524-554

Abstract: Abstract Given an undirected tree $$T=(V,E)$$ T = ( V , E ) and a value $$\sigma >0$$ σ > 0 , every edge $$e\in E$$ e ∈ E has a lead time l(e) and a capacity c(e). Let $$P_{st}$$ P st be the unique path connecting s and t. A transmission time of sending $$\sigma $$ σ units data from s to $$t\in V$$ t ∈ V is $$Q(s,t,\sigma )=l(P_{st})+\frac{\sigma }{c(P_{st})}$$ Q ( s , t , σ ) = l ( P st ) + σ c ( P st ) , where $$l(P_{st})=\sum _{e\in P_{st}}l(e)$$ l ( P st ) = ∑ e ∈ P st l ( e ) and $$c(P_{st})=\min _{e\in P_{st}} c(e)$$ c ( P st ) = min e ∈ P st c ( e ) . A vertex (an absolute) quickest 1-center problem is to determine a vertex $$s^*\in V$$ s ∗ ∈ V (a point $$s^*\in T$$ s ∗ ∈ T , which is either a vertex or an interior point in some edge) whose maximum transmission time is minimum. In an inverse vertex (absolute) quickest 1-center problem on a tree T, we aim to modify a capacity vector with minimum cost under weighted $$l_1$$ l 1 norm such that a given vertex (point) becomes a vertex (an absolute) quickest 1-center. We first introduce a maximum transmission time balance problem between two trees $$T_1$$ T 1 and $$T_2$$ T 2 , where we reduce the maximum transmission time of $$T_1$$ T 1 and increase the maximum transmission time of $$T_2$$ T 2 until the maximum transmission time of the two trees become equal. We present an analytical form of the objective function of the problem and then design an $$O(n_1^2n_2)$$ O ( n 1 2 n 2 ) algorithm, where $$n_i$$ n i is the number of vertices of $$T_i$$ T i with $$i=1, 2$$ i = 1 , 2 . Furthermore, we analyze some optimality conditions of the two inverse problems, which support us to transform them into corresponding maximum transmission time balance problems. Finally, we propose two $$O(n^3)$$ O ( n 3 ) algorithms, where n is the number of vertices in T.

Keywords: Center location; Quickest 1-center problem; Tree; Inverse optimization; $$l_1$$ l 1 norm; 90C27 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-023-02362-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:joptap:v:200:y:2024:i:2:d:10.1007_s10957-023-02362-6

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-023-02362-6

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().