Efficient continuous-time dynamic network flow algorithms
From MaRDI portal
Publication:1306377
DOI10.1016/S0167-6377(98)00037-6zbMath0947.90016OpenAlexW2039657689MaRDI QIDQ1306377
Publication date: 19 December 1999
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00037-6
Related Items (56)
Evacuation planning by earliest arrival contraflow ⋮ Algorithms for Flows over Time with Scheduling Costs ⋮ Traveling salesman problems in temporal graphs ⋮ Efficient contraflow algorithms for quickest evacuation planning ⋮ Multicommodity flows over time: Efficient algorithms and complexity ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Evacuation modeling: a case study on linear and nonlinear network flow models ⋮ Dynamic Equilibria in Fluid Queueing Networks ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Efficient continuous contraflow algorithms for evacuation planning problems ⋮ On the Price of Anarchy for Flows over Time ⋮ On Verifying and Maintaining Connectivity of Interval Temporal Networks ⋮ The complexity of optimal design of temporally connected graphs ⋮ A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ An exact algorithm for the service network design problem with hub capacity constraints ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Scalable timing-aware network design via Lagrangian decomposition ⋮ The inverse maximum dynamic flow problem ⋮ The Maximum Energy-Constrained Dynamic Flow Problem ⋮ Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach ⋮ Unnamed Item ⋮ Continuous and discrete flows over time ⋮ An Introduction to Network Flows over Time ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An introduction to dynamic generative networks: minimum cost flow ⋮ On solving maximum and quickest interval-valued flows over time ⋮ Network flow with intermediate storage: models and algorithms ⋮ A polynomial time algorithm for the minimum flow problem in time-varying networks ⋮ Temporal network optimization subject to connectivity constraints ⋮ Earliest arrival flows in networks with multiple sinks ⋮ Existence and Uniqueness of Equilibria for Flows over Time ⋮ Continuous time dynamic contraflow models and algorithms ⋮ Abstract flows over time: a first step towards solving dynamic packing problems ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths ⋮ Universally maximum flow with piecewise-constant capacities ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Competitive routing over time ⋮ Improved algorithms for the evacuation route planning problem ⋮ Partial contraflow with path reversals for evacuation planning ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ A Stackelberg strategy for routing flow over time ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ A simplex algorithm for minimum-cost network-flow problems in infinite networks ⋮ Traffic Networks and Flows over Time ⋮ Logistics networks: a game theory application for solving the transshipment problem ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective* ⋮ Heterogeneous multi-commodity network flows over time ⋮ Abstract network flow with intermediate storage for evacuation planning ⋮ Algorithms for flows over time with scheduling costs ⋮ Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of dynamic network flows
- Transient flows in networks
- On continuous network flows
- Optimal dynamic routing in communication networks with continuous traffic
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- A continuous-time network simplex algorithm
- A Class of Continuous Network Flow Problems
- Optimal flows in networks with multiple sources and sinks
- Maximal, Lexicographic, and Dynamic Network Flows
- An Algorithm for a Class of Continuous Linear Programs
- A Study of General Dynamic Network Programs with Arc Time-Delays
- A bad network problem for the simplex method and other minimum cost flow algorithms
- An adaptive discretization algorithm for a class of continuous network programs
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- Continuous-Time Flows in Networks
This page was built for publication: Efficient continuous-time dynamic network flow algorithms
