Skip to main content
Log in

Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The inverse max+sum spanning tree problem is considered by modifying the sum-cost vector under weighted \(l_1\) norm. On an undirected network G(VEcw), a cost c(e) and a weight w(e) are prescribed for each edge \(e\in E\). The max+sum spanning tree (MSST) problem is to find a spanning tree \(T^*\) which makes the combined weight \(\max _{e\in T}w(e)+\sum _{e\in T}c(e)\) as small as possible. It can be solved in \(O(m\log n)\) time, where \(m=|E|\) and \(n=|V|\). Whereas, in an inverse MSST problem, \(T_0\) is a given spanning tree of G, which is not an optimal MSST. The sum-cost vector c is to be modified to \(\bar{c}\) so that \(T_0\) becomes an optimal MSST of the new network \(G(V,E,\bar{c},w)\). The goal is to minimize the modification cost \(\Vert \bar{c}-c\Vert _1\) incurred by adjusting the sum-cost vector under weighted \(l_1\) norm. The inverse MSST problem under weighted \(l_1\) norm can be formulated as a linear programming problem with exponential number of constraints. Then a column generation algorithm is proposed to solve its dual problem. It is extremely interesting that in each iteration the choice of entering variable can be determined by solving an MSST problem with new sum-cost \(\tilde{c}\). Computational experiments show that the column generation algorithm can find the optimal solutions of the inverse problem although the number of iterations as well as the running time grow fast with the increase in the size of the instance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Ahuja, R.K., Orlin, J.B.: A faster algorithm for the inverse spanning tree problem. J. Algorithms 34, 177–193 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahuja, R.K., Orlin, J.B.: Inverse optimization. Oper. Res. 49(5), 771–783 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Duin, C.W., Volgenant, A.: Minimum deviation and balanced optimization: a unified approach. Oper. Res. Lett. 10, 43–48 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Duin, C.W., Volgenant, A.: Some inverse optimization problems under the Hamming distance. Eur. J. Oper. Res. 170, 887–899 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gondzioa, J., González-Brevisa, P., Munarib, P.: New developments in the primal-dual column generation technique. Eur. J. Oper. Res. 224, 41–51 (2013)

    Article  MathSciNet  Google Scholar 

  6. Guan, X.C., Zhang, J.Z.: Inverse constrained bottleneck problems under weighted \(l_\infty \) norm. Comput. Oper. Res. 34, 3243–3254 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Guan, X.C., Pardalos, P.M., Zuo, X.: Inverse max+ sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) Norm. J. Glob. Optim. 61(1), 165–182 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Guan, X.C., Zhang, B.W.: Inverse 1-median problem on trees under weighted Hamming distance. J. Glob. Optim. 54(1), 75–82 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. He, Y., Zhang, B.W., Yao, E.Y.: Weighted inverse minimum spanning tree problems under Hamming distance. J. Comb. Optim. 9, 91–100 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Heuburger, C.: Inverse optimization: a survey on problems, methods, and results. J. Comb. Optim. 8(3), 329–361 (2004)

    Article  MathSciNet  Google Scholar 

  11. Hochbaum, D.S.: Efficient algorithms for the inverse spanning tree problem. Oper. Res. 51(5), 785–797 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Liu, L.C., Wang, Q.: Constrained inverse min–max spanning tree problems under the weighted Hamming distance. J. Glob. Optim. 43, 83–95 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Liu, L., Yao, E.: Inverse min–max spanning tree problem under the weighted sum-type Hamming distance. Lect. Notes Comput. Sci. 4614, 375–383 (2007)

    Article  MATH  Google Scholar 

  14. Minoux, M.: Solving combinatorial problems with combined minmax-minsum objective and applications. Math. Progr. Ser. B 45, 361–371 (1989)

    Article  MATH  Google Scholar 

  15. Punnen, A.P.: On combined minmax-minsum optimization. Comput. Oper. Res. 21(6), 707–716 (1994)

    Article  MATH  Google Scholar 

  16. Punnen, A.P., Nair, K.P.K.: An \(O(m \log n)\) algorithm for the max+sum spanning tree problem. Eur. J. Oper. Res. 89, 423–426 (1996)

    Article  MATH  Google Scholar 

  17. Scheinerman E.R., Matgraph is a Matlab toolbox for simple graphs. http://www.ams.jhu.edu/~ers/matgraph/

  18. Sokkalingam, P.T., Ahuja, R.K., Orlin, J.B.: Solving inverse spanning tree problems through network flow techniques. Oper. Res. 47(2), 291–298 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  19. Yamada, T., Takahashi, H., Kataoka, S.: A heuristic algorithm for the mini–max spanning forest problem. Eur. J. Oper. Res. 91, 565–572 (1996)

    Article  MATH  Google Scholar 

  20. Yang, X.G., Zhang, J.Z.: Some inverse min–max network problems under weighted \(l_1\) and \(l_\infty \) norms with bound constraints on changes. J. Comb. Optim. 13, 123–135 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zhang, B., Zhang, J., He, Y.: Constrained Inverse minimum spanning tree problems under the bottleneck-type Hamming distance. J. Glob. Optim. 34(3), 467–474 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Zhang, J.Z., Liu, Z., Ma, Z.: On the inverse problem of minimum spanning tree with partition constraints. Math. Methods Oper. Res. 44, 171–187 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiucui Guan.

Additional information

Research is supported by National Natural Science Foundation of China (11471073).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guan, X., Pardalos, P.M. & Zhang, B. Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector. Optim Lett 12, 1065–1077 (2018). https://doi.org/10.1007/s11590-017-1165-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-017-1165-2

Keywords

Navigation