Shortest Path and Network Flow Algorithms
From MaRDI portal
Publication:3901333
DOI10.1016/S0167-5060(08)70830-6zbMath0453.90099OpenAlexW1044267164MaRDI QIDQ3901333
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
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Polynomial-time primal simplex algorithms for the minimum cost network flow problem, An algorithm to determine a path with minimal cost/capacity ratio, An algorithm to determine a path with minimal cost/capacity ratio, The partial sum criterion for Steiner trees in graphs and shortest paths, An algorithm for ranking paths in acyclic networks, On a special class of bicriterion path problems, An algorithm for the ranking of shortest paths, 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, Roof duality, complementation and persistency in quadratic 0–1 optimization, Asynchronous transfer mode networks with parallel links and multiple service classes
