Some Recent Advances in Network Flows

DOI10.1137/1033048MaRDI QIDQ3359973zbMATH OpenOpenAlexFDO

Authors Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin

Publication date 1991

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1033048

zbMATH Keywords

enhanced data structuresmaximum flowminimum cost flowpotential functionspreflow push algorithmspseudoflow push algorithmsradix heap algorithmscalingshortest pathsurveyworst-case performance

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) Programming involving graphs or networks (90C35)

Recommendations

• Flows on networks: recent results and perspectives
• New algorithms for generalized network flows
• A survey of dynamic network flows
• scientific article; zbMATH DE number 3174052
• Network flows. Theory, algorithms, and applications.
• On continuous network flows
• scientific article; zbMATH DE number 42283
• scientific article; zbMATH DE number 3904300
• Flows on networks and complicated domains
• On network flow functions

Cited in

(25)

• New algorithms for generalized network flows
• Sequential and parallel algorithms for minimum flows.
• Algorithms for dense graphs and networks on the random access computer
• Problems of synthesis of connected networks with respect to isomorphic subgraphs
• Analysis of Preflow Push Algorithms for Maximum Network Flow
• scientific article; zbMATH DE number 5817034 (Why is no real title available?)
• scientific article; zbMATH DE number 1004242 (Why is no real title available?)
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• Performance of Shortest Path Algorithms in Network Flow Problems
• scientific article; zbMATH DE number 3904300 (Why is no real title available?)
• Common aspects of several network flow algorithms
• scientific article; zbMATH DE number 42283 (Why is no real title available?)
• scientific article; zbMATH DE number 176469 (Why is no real title available?)
• CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL
• scientific article; zbMATH DE number 1964672 (Why is no real title available?)
• Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• Some recent contributions to network optimization
• Modeling demand management strategies for evacuations
• The problem of synthesis of reliable networks
• The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
• An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
• Node coincidence in metric minimum weighted length graph embeddings
• Network flows and non-guillotine cutting patterns

This page was built for publication: Some Recent Advances in Network Flows

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