Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted $$l_\infty $$ l ∞ Norm

Xiucui Guan (), Panos Pardalos and Xia Zuo

Journal of Global Optimization, 2015, vol. 61, issue 1, 165-182

Abstract: The inverse max + sum spanning tree (IMSST) problem is studied, which is the first inverse problem on optimization problems with combined minmax–minsum objective functions. Given an edge-weighted undirected network $$G(V,E,c,w)$$ G ( V , E , c , w ) , the MSST problem is to find a spanning tree $$T$$ T which minimizes the combined weight $$\max _{e\in T}w(e)+\sum _{e\in T}c(e)$$ max e ∈ T w ( e ) + ∑ e ∈ T c ( e ) , which can be solved in $$O(m\log n)$$ O ( m log n ) time, where $$m:=|E|$$ m : = | E | and $$n:=|V|$$ n : = | V | . Whereas, in an IMSST problem, a spanning tree $$T_0$$ T 0 of $$G$$ G is given, which is not an optimal MSST. A new sum-cost vector $$\bar{c}$$ c ¯ is to be identified so that $$T_0$$ T 0 becomes an optimal MSST of the network $$G(V,E,\bar{c},w)$$ G ( V , E , c ¯ , w ) , where $$0\le c-l\le \bar{c} \le c+u$$ 0 ≤ c - l ≤ c ¯ ≤ c + u and $$l,u\ge 0$$ l , u ≥ 0 . The objective is to minimize the cost $$\max _{e\in E}q(e)|\bar{c}(e)-c(e)|$$ max e ∈ E q ( e ) | c ¯ ( e ) - c ( e ) | incurred by modifying the sum-cost vector $$c$$ c under weighted $$l_\infty $$ l ∞ norm, where $$q(e)\ge 1$$ q ( e ) ≥ 1 . We show that the unbounded IMSST problem is a linear fractional combinatorial optimization (LFCO) problem and develop a discrete type Newton method to solve it. Furthermore, we prove an $$O(m)$$ O ( m ) bound on the number of iterations, although most LFCO problems can be solved in $$O(m^2 \log m)$$ O ( m 2 log m ) iterations. Therefore, both the unbounded and bounded IMSST problems can be solved by solving $$O(m)$$ O ( m ) MSST problems. Computational results show that the algorithms can efficiently solve the problems. Copyright Springer Science+Business Media New York 2015

Keywords: Inverse max + sum spanning tree problem; Inverse optimization problem; $$l_\infty $$ l ∞ norm; Linear fractional combinatorial optimization; Discrete type Newton method (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-014-0140-z (text/html)
Access to full text is restricted to subscribers.

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:jglopt:v:61:y:2015:i:1:p:165-182

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-014-0140-z

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

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