scientific article; zbMATH DE number 4207199

zbMATH Open0729.90038MaRDI QIDQ3354444FDOQ3354444

Authors: Han Ju Myong 

Publication date: 1990

Title of this publication is not available (Why is that?)

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
• Publication:4891657

zbMATH Keywords

transportation networkmax-flow augmentation algorithmminimal matrix cut

Mathematics Subject Classification ID

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

Cited In (5)

• A decomposition of the matroids with the max-flow min-cut property
• Recognizing max-flow min-cut path matrices
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• Title not available (Why is that?)
• 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)