Shortest Path and Network Flow Algorithms

DOI10.1016/S0167-5060(08)70830-6MaRDI QIDQ3901333zbMATH OpenOpenAlexFDO

Authors Eugene L. Lawler

Publication date 1979

Published in Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70830-6

zbMATH Keywords

network flow algorithmsshortest path algorithmssurvey paper

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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)

Cited in

(11)

• An algorithm for ranking paths in acyclic networks
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• An improvement of Dijkstra's method for finding a shortest path in a graph
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem
• The partial sum criterion for Steiner trees in graphs and shortest paths
• An algorithm for the ranking of shortest paths
• Asynchronous transfer mode networks with parallel links and multiple service classes
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• An algorithm to determine a path with minimal cost/capacity ratio
• An algorithm to determine a path with minimal cost/capacity ratio
• On a special class of bicriterion path problems

This page was built for publication: Shortest Path and Network Flow Algorithms

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