Efficient continuous-time dynamic network flow algorithms
From MaRDI portal
Publication:1306377
DOI10.1016/S0167-6377(98)00037-6zbMATH Open0947.90016OpenAlexW2039657689MaRDI QIDQ1306377FDOQ1306377
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for a Class of Continuous Linear Programs
- Continuous-Time Flows in Networks
- Transient flows in networks
- Title not available (Why is that?)
- A survey of dynamic network flows
- Title not available (Why is that?)
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- Optimal dynamic routing in communication networks with continuous traffic
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- Title not available (Why is that?)
- A continuous-time network simplex algorithm
- A Class of Continuous Network Flow Problems
- A Study of General Dynamic Network Programs with Arc Time-Delays
- An adaptive discretization algorithm for a class of continuous network programs
- Optimal flows in networks with multiple sources and sinks
- Maximal, Lexicographic, and Dynamic Network Flows
- A bad network problem for the simplex method and other minimum cost flow algorithms
- On continuous network flows
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (70)
- On Verifying and Maintaining Connectivity of Interval Temporal Networks
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- Sink location problems in dynamic flow grid networks
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
- Temporally connected components
- An exact algorithm for the service network design problem with hub capacity constraints
- Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach
- Sink location problems in dynamic flow grid networks
- Bicriteria Nash flows over time
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
- Scalable timing-aware network design via Lagrangian decomposition
- Generalized maximum flow over time with intermediate storage
- Logistics networks: a game theory application for solving the transshipment problem
- Title not available (Why is that?)
- On continuous network flows
- Dynamic flows in networks
- Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks
- An Introduction to Network Flows over Time
- Title not available (Why is that?)
- Existence and Uniqueness of Equilibria for Flows over Time
- Evacuation planning by earliest arrival contraflow
- Algorithms for flows over time with scheduling costs
- Multicommodity flows over time: Efficient algorithms and complexity
- Abstract flows over time: a first step towards solving dynamic packing problems
- Traveling salesman problems in temporal graphs
- Title not available (Why is that?)
- Continuous-Time Flows in Networks
- A Stackelberg strategy for routing flow over time
- Improved algorithms for the evacuation route planning problem
- Continuous time dynamic contraflow models and algorithms
- A polynomial time algorithm for the minimum flow problem in time-varying networks
- A heuristic algorithm for the earliest arrival flow with multiple sources
- The Maximum Energy-Constrained Dynamic Flow Problem
- An adaptive discretization algorithm for a class of continuous network programs
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- The complexity of optimal design of temporally connected graphs
- Algorithms for dynamic NFV workload
- Title not available (Why is that?)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- Flows over time in time-varying networks: optimality conditions and strong duality
- Continuous dynamic contraflow approach for evacuation planning
- Dynamic Atomic Congestion Games with Seasonal Flows
- On the Price of Anarchy for Flows over Time
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
- Efficient contraflow algorithms for quickest evacuation planning
- Continuous and discrete flows over time
- Algorithms for Flows over Time with Scheduling Costs
- The inverse maximum dynamic flow problem
- Evacuation modeling: a case study on linear and nonlinear network flow models
- Universally maximum flow with piecewise-constant capacities
- Temporal network optimization subject to connectivity constraints
- On solving maximum and quickest interval-valued flows over time
- Efficient continuous contraflow algorithms for evacuation planning problems
- Nash equilibria and the price of anarchy for flows over time
- Earliest arrival flows in networks with multiple sinks
- An introduction to dynamic generative networks: minimum cost flow
- Competitive routing over time
- A simplex-type algorithm for continuous linear programs with constant coefficients
- A survey on models and algorithms for discrete evacuation planning network problems
- Minimum‐cost flow problems having arc‐activation costs
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Abstract network flow with intermediate storage for evacuation planning
- Title not available (Why is that?)
- An Introduction to Temporal Graphs: An Algorithmic Perspective
- Traffic Networks and Flows over Time
- Network flow with intermediate storage: models and algorithms
- A comparison of phase and nonphase network flow algorithms
- Partial contraflow with path reversals for evacuation planning
- Heterogeneous multi-commodity network flows over time
- Dynamic Equilibria in Fluid Queueing Networks
This page was built for publication: Efficient continuous-time dynamic network flow algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306377)
