Some Recent Advances in Network Flows
From MaRDI portal
Publication:3359973
DOI10.1137/1033048zbMath0732.90028OpenAlexW1985036904MaRDI QIDQ3359973
James B. Orlin, Ravindra K. Ahuja, Thomas L. Magnanti
Publication date: 1991
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1033048
surveyshortest pathscalingworst-case performanceminimum cost flowpotential functionsmaximum flowpreflow push algorithmsenhanced data structurespseudoflow push algorithmsradix heap algorithm
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Sequential and parallel algorithms for minimum flows., Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions, Algorithms for dense graphs and networks on the random access computer, The invisible‐hand heuristic for origin‐destination integer multicommodity network flows, An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems, CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL, Modeling demand management strategies for evacuations, The problem of synthesis of reliable networks, Problems of synthesis of connected networks with respect to isomorphic subgraphs, A comprehensive simplex-like algorithm for network optimization and perturbation analysis
