An algorithm for inverse minimum spanning tree problem

DOI10.1080/10556789708805666MaRDI QIDQ4378113zbMATH OpenOpenAlexWikidataFDO

Authors Jianzhong Zhang, Zhongfan Ma, Shaoji Xu

Publication date 25 February 1998

Published in Optimization Methods \& 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)

Recommendations

• A Faster Algorithm for the Inverse Spanning Tree Problem
• scientific article; zbMATH DE number 949659
• Efficient Algorithms for the Inverse Spanning-Tree Problem
• Partial inverse min-max spanning tree problem
• Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance

Cites work

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

Cited in

(23)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378113)