Inverse Max+Sum Spanning Tree Problems

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

Chapter Chapter 10 in Inverse Combinatorial Optimization Problems, 2025, pp 231-252 from Springer

Abstract: Abstract In this chapter, the inverse max+sum spanning tree problem, a novel class of inverse optimization problems with combined minimax-minsum objectives, has been thoroughly examined. By focusing on the modification of the sum-cost vector under both weighted l 1 $$l_1$$ and l ∞ $$l_\infty $$ norms, as well as under weighted Hamming distance, we have developed mathematical models and efficient algorithms. The l 1 $$l_1$$ norm problem has been transformed into a linear programming problem, addressed with a column generation algorithm, revealing a fascinating connection to the max+sum spanning tree problem, solvable in O ( m log n ) $$O(m \log n)$$ time. The l ∞ $$l_\infty $$ norm problem has been proven to be a linear fractional combinatorial optimization problem, tackled with a discrete Newton method within O ( m 2 log m ) $$O(m^2 \log m)$$ iterations. For the Hamming distance, a binary search algorithm has been designed for the bottleneck case with a complexity of O ( m log 2 n ) $$O(m \log ^2 n)$$ , while the sum case has been identified as NP-hard. Modifying the max weight vector under the l ∞ $$l_\infty $$ norm led to a strongly polynomial time algorithm with a runtime of O ( m 2 log n ) $$O(m^2 \log n)$$ .

Keywords: Inverse max+sum spanning tree problems, Minimax-minsum objective, Column generation algorithm, Linear fractional combinatorial optimization problem, Discrete Newton method; NP-hard (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_10

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

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

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