An algorithm for inverse minimum spanning tree problem

DOI10.1080/10556789708805666zbMath0894.90157OpenAlexW1965702747WikidataQ126240899 ScholiaQ126240899MaRDI QIDQ4378113

Zhang, Jianzhong, Zhongfan Ma, Shao-Ji Xu

Publication date: 25 February 1998

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789708805666

zbMATH Keywords

bipartite graphpolynomial timeminimum covering probleminverse minimum spanning tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (18)

Partial inverse min-max spanning tree problem ⋮ Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ Inverse maximum capacity problems ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ The partial inverse minimum spanning tree problem when weight increase is forbidden ⋮ Robust partial inverse network flow problems ⋮ Weighted inverse minimum spanning tree problems under Hamming distance ⋮ The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance ⋮ Note on inverse problem with \(l_\infty\) objective function ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems ⋮ Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm ⋮ Inverse optimization problems with multiple weight functions

Cites Work

• On an instance of the inverse shortest paths problem
• An inverse problem of the weighted shortest path problem
• Calculating some inverse linear programming problems
• Inverse maximum flow and minimum cut problems
• A column generation method for inverse shortest path problems
• Unnamed Item

This page was built for publication: An algorithm for inverse minimum spanning tree problem