Inverse Quickest 1-Center Location Problem on Trees

Xiucui Guan, Panos M. Pardalos and Binwu Zhang
Additional contact information
Xiucui Guan: Southeast University
Binwu Zhang: Hohai University

Chapter Chapter 14 in Inverse Combinatorial Optimization Problems, 2025, pp 339-360 from Springer

Abstract: Abstract This chapter investigates the inverse quickest 1-center (IQ1C) location problem on trees under different norms, focusing on modifying network capacities to optimize emergency response times. We first introduce optimality conditions for vertex and absolute quickest 1-center problems. Then we propose an O ( n 2 log n ) $$O(n^2 \log n)$$ algorithm for the inverse problem (IQ1C) under the weighted l ∞ $$l_\infty $$ norm and an O ( n 3 ) $$O(n^3)$$ algorithm under the weighted l 1 $$l_1$$ norm. The algorithms ensure a designated vertex becomes the quickest 1-center, enhancing network performance for critical applications.

Keywords: Inverse quickest 1-center; Vertex and absolute quickest 1-center problems; Maximum transmission time balance problem (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spochp:978-3-031-91175-0_14

Ordering information: This item can be ordered from
http://www.springer.com/9783031911750

DOI: 10.1007/978-3-031-91175-0_14

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().