scientific article; zbMATH DE number 949659

MaRDI QIDQ4716335zbMATH OpenFDO

Authors Jianzhong Zhang, Zhenhong Liu, Zhongfan Ma

Publication date 26 November 1996

zbMATH Keywords

inverse problemmaximum cost flow in networksminimum spanning treepartition constraintsstrongly polynomial algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• An algorithm for inverse minimum spanning tree problem
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• Partial inverse min-max spanning tree problem
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Inverse constrained minimum spanning tree problem under Hamming distance

Cited in

(23)

• Inverse optimization for linearly constrained convex separable programming problems
• Note on inverse problem with l_ objective function
• Inverse problem of minimum cuts
• Inverse maximum capacity problems
• Inverse problems of submodular functions on digraphs
• Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
• Weighted inverse minimum spanning tree problems under Hamming distance
• Two general methods for inverse optimization problems
• Calculating some inverse linear programming problems
• The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
• Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
• Computational aspects of the inverse single facility location problem on trees under l_k-norm
• 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
• The minimum weight spanning tree with constraints
• An algorithm for inverse minimum spanning tree problem
• Notes on inverse bin-packing problems
• Balanced Partition of Minimum Spanning Trees
• A Faster Algorithm for the Inverse Spanning Tree Problem
• The inverse center subtree problem on tree graphs
• Inverse max+sum spanning tree problem under weighted l₁ norm by modifying the sum-cost vector
• Partial inverse min-max spanning tree problem
• Inverse minimum flow problem

This page was built for publication:

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