scientific article; zbMATH DE number 949659
From MaRDI portal
Publication:4716335
zbMath0861.90120MaRDI QIDQ4716335
Zhongfan Ma, Zhang, Jianzhong, Zhenhong Liu
Publication date: 26 November 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
inverse problemminimum spanning treestrongly polynomial algorithmpartition constraintsmaximum cost flow in networks
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (17)
Partial inverse min-max spanning tree problem ⋮ Inverse minimum flow problem ⋮ Calculating some inverse linear programming problems ⋮ Inverse maximum capacity problems ⋮ Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Notes on inverse bin-packing problems ⋮ Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm ⋮ 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 ⋮ Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector ⋮ Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance ⋮ Two general methods for inverse optimization problems ⋮ Note on inverse problem with \(l_\infty\) objective function ⋮ Inverse problems of submodular functions on digraphs ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ Inverse problem of minimum cuts
This page was built for publication:
