A Class of Continuous Network Flow Problems
From MaRDI portal
Publication:3964298
DOI10.1287/moor.7.4.501zbMath0498.90031OpenAlexW2049626836MaRDI QIDQ3964298
Peter Nash, Edward J. Anderson, Andy B. Philpott
Publication date: 1982
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.7.4.501
minimum cutduality theoryFord-Fulkersonmaximal network flowcontinuous linear programlabelling algorithmsolution of continuous timestorage at the nodestime-varying arc capacities
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)
Related Items (21)
On continuous network flows ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ Continuous and discrete flows over time ⋮ An Introduction to Network Flows over Time ⋮ A survey of dynamic network flows ⋮ On solving continuous-time dynamic network flows ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On solving maximum and quickest interval-valued flows over time ⋮ Distributed shortest-path protocols for time-dependent networks ⋮ Continuous time dynamic contraflow models and algorithms ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Perspectives on integer programming for time-dependent models ⋮ Universally maximum flow with piecewise-constant capacities ⋮ A measure-theoretical max-flow-min-cut problem ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ A simplex algorithm for minimum-cost network-flow problems in infinite networks ⋮ Optimal control on a graph with application to train scheduling problems ⋮ Efficient continuous-time dynamic network flow algorithms ⋮ Examples of max-flow and min-cut problems with duality gaps in continuous networks
This page was built for publication: A Class of Continuous Network Flow Problems
