Algorithms for maximum network flow

DOI10.1007/BFB0121085MaRDI QIDQ3725836zbMATH OpenFDO

Authors Robert E. Tarjan

Publication date 1986

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0121085

zbMATH Keywords

efficient algorithmsmaximum flow problemrooted treessparse graphssurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 65738
• A Fast and Simple Algorithm for the Maximum Flow Problem
• scientific article; zbMATH DE number 4204092
• scientific article; zbMATH DE number 3900543
• A new approach to the maximum-flow problem

Cited in

(24)

• On the maximum capacity augmentation algorithm for the maximum flow problem
• New algorithms for generalized network flows
• Maximum balanced flow in a network
• A dual graph algorithm model and its implementation of the maximum flow on the large-scale networks
• New algorithm for maximum flow algorithm in network with both node and edge capacity confined
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• scientific article; zbMATH DE number 5371757 (Why is no real title available?)
• scientific article; zbMATH DE number 3900543 (Why is no real title available?)
• Common aspects of several network flow algorithms
• scientific article; zbMATH DE number 4053314 (Why is no real title available?)
• A anonmonotone line search technique for improved projected quasi-newton methods^*this research was supported in party by the national natural science foundation of china$ef:
• scientific article; zbMATH DE number 65738 (Why is no real title available?)
• scientific article; zbMATH DE number 515924 (Why is no real title available?)
• scientific article; zbMATH DE number 1022488 (Why is no real title available?)
• scientific article; zbMATH DE number 1953188 (Why is no real title available?)
• scientific article; zbMATH DE number 1759406 (Why is no real title available?)
• scientific article; zbMATH DE number 218386 (Why is no real title available?)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• Algorithm model research of the logical cutting tree on the network maximum flow
• Gradients and flows: continuous optimization approaches to the maximum flow problem
• Computing and Combinatorics
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
• Incremental network design with maximum flows
• The maximum flow problem of uncertain network

This page was built for publication: Algorithms for maximum network flow

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