Publication:4716335
From MaRDI portal
zbMath0861.90120MaRDI QIDQ4716335
Zhang, Jianzhong, Zhenhong Liu, Zhongfan Ma
Publication date: 26 November 1996
inverse problem; minimum spanning tree; strongly polynomial algorithm; partition constraints; maximum cost flow in networks
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Inverse minimum flow problem, Inverse optimization for linearly constrained convex separable programming problems, Note on inverse problem with \(l_\infty\) objective function, Inverse problem of minimum cuts, Inverse maximum capacity problems, Inverse problems of submodular functions on digraphs, Weighted inverse minimum spanning tree problems under Hamming distance, Two general methods for inverse optimization problems, Calculating some inverse linear programming problems