An algorithm for inverse minimum spanning tree problem

DOI10.1080/10556789708805666zbMath0894.90157MaRDI 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 graph; polynomial time; minimum covering problem; inverse minimum spanning tree problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Related Items

Robust partial inverse network flow problems, Note on inverse problem with \(l_\infty\) objective function, Inverse maximum capacity problems, Inverse problems of submodular functions on digraphs, Some reverse location problems, Weighted inverse minimum spanning tree problems under Hamming distance, Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes, The partial inverse minimum spanning tree problem when weight increase is forbidden

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