scientific article; zbMATH DE number 4207199

MaRDI QIDQ3354444zbMATH OpenFDO

Authors Han Ju Myong

Publication date 1990

zbMATH Keywords

max-flow augmentation algorithmminimal matrix cuttransportation network

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10)

Recommendations

• Minimum cut problem using bases of extended polymatroids
• scientific article; zbMATH DE number 2190137
• Sensitive and parametric analysis of the maximum flow in a network
• Maximum cuts for a minimum flow
• scientific article; zbMATH DE number 926181

Cited in

(5)

• Recognizing max-flow min-cut path matrices
• A decomposition of the matroids with the max-flow min-cut property
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• scientific article; zbMATH DE number 926181 (Why is no real title available?)
• Network flows and non-guillotine cutting patterns

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 Q3354444)