Restricted Inverse Optimal Value Problem on Minimum Spanning Tree

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

Chapter Chapter 11 in Inverse Combinatorial Optimization Problems, 2025, pp 253-282 from Springer

Abstract: Abstract In this chapter, we address the restricted inverse optimal value problem on minimum spanning tree under various norms. Under the weighted l ∞ $$l_{\infty }$$ norm with bounds, we establish optimality conditions and develop two efficient algorithms operating in O ( m 2 n ) $$O(m^2n)$$ and O ( m 2 log n ) $$O(m^2\log n)$$ , where m and n $$m\ \mbox{and}\ n$$ are the number of edges and nodes of a graph G. Additionally, an O ( mn ) $$O(mn)$$ algorithm is introduced for the (RIOVMST ∞ $${ }_\infty $$ ) problem with unit norm and bounds. For the l 1 $$l_1$$ norm case, we formulate the problem as a linear program, derive a dual subproblem, and calculate a critical value z ∗ $$z^*$$ using binary search, ultimately solving the problem with a complexity of O ( m 2 n 2 log n log ( nC ) ) $$O(m^2n^2\log n\log (nC))$$ . Under the bottleneck Hamming distance, three binary search algorithms are developed with a uniform time complexity of O ( mn log n ) $$O(mn\log n)$$ . An open problem is posed regarding a strongly polynomial time algorithm for the (RIOVMST 1 $$_1$$ ) problem.

Keywords: Restricted inverse optimal value problem; Minimum spanning tree; Binary search method; Dual theory; Polynomial time algorithm; Open 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_11

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

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

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 ().