Efficient continuous-time dynamic network flow algorithms
From MaRDI portal
Publication:1306377
Recommendations
Cites work
- scientific article; zbMATH DE number 1003275 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 1303551 (Why is no real title available?)
- scientific article; zbMATH DE number 1342127 (Why is no real title available?)
- scientific article; zbMATH DE number 910909 (Why is no real title available?)
- scientific article; zbMATH DE number 934458 (Why is no real title available?)
- scientific article; zbMATH DE number 956788 (Why is no real title available?)
- A Class of Continuous Network Flow Problems
- 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
- A continuous-time network simplex algorithm
- A survey of dynamic network flows
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- An Algorithm for a Class of Continuous Linear Programs
- An adaptive discretization algorithm for a class of continuous network programs
- Continuous-Time Flows in Networks
- Maximal, Lexicographic, and Dynamic Network Flows
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- On continuous network flows
- Optimal dynamic routing in communication networks with continuous traffic
- Optimal flows in networks with multiple sources and sinks
- Transient flows in networks
Cited in
(71)- An introduction to network flows over time
- Continuous and discrete flows over time
- Heterogeneous multi-commodity network flows over time
- The Maximum Energy-Constrained Dynamic Flow Problem
- A Stackelberg strategy for routing flow over time
- Nash equilibria and the price of anarchy for flows over time
- An introduction to temporal graphs: an algorithmic perspective
- The inverse maximum dynamic flow problem
- Flows over time in time-varying networks: optimality conditions and strong duality
- An adaptive discretization algorithm for a class of continuous network programs
- Earliest arrival flows in networks with multiple sinks
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
- Minimum‐cost flow problems having arc‐activation costs
- Algorithms for flows over time with scheduling costs
- Maximum contraflow evacuation planning problems on multi-network
- Evacuation planning by earliest arrival contraflow
- Partial contraflow with path reversals for evacuation planning
- On the price of anarchy for flows over time
- Efficient contraflow algorithms for quickest evacuation planning
- Traveling salesman problems in temporal graphs
- The complexity of optimal design of temporally connected graphs
- Logistics networks: a game theory application for solving the transshipment problem
- Maximum FlowLoc problems with network reconfiguration
- Multicommodity flows over time: Efficient algorithms and complexity
- Dynamic equilibria in fluid queueing networks
- Continuous dynamic contraflow approach for evacuation planning
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Continuous time dynamic contraflow models and algorithms
- A simplex-type algorithm for continuous linear programs with constant coefficients
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- Dynamic flows in time-varying networks.
- Abstract flows over time: a first step towards solving dynamic packing problems
- Dynamic network contraflow evacuation planning problem with continuous time approach
- Efficient continuous contraflow algorithms for evacuation planning problems
- Temporal network optimization subject to connectivity constraints
- Abstract network flow with intermediate storage for evacuation planning
- An introduction to dynamic generative networks: minimum cost flow
- Competitive routing over time
- Long-term behavior of dynamic equilibria in fluid queuing networks
- A critical survey on the network optimization algorithms for evacuation planning problems
- Algorithms for dynamic NFV workload
- Network flow with intermediate storage: models and algorithms
- Traffic Networks and Flows over Time
- A survey on models and algorithms for discrete evacuation planning network problems
- An introduction to temporal graphs: an algorithmic perspective
- A heuristic algorithm for the earliest arrival flow with multiple sources
- Dynamic flows in networks
- Algorithms for Flows over Time with Scheduling Costs
- Continuous-Time Flows in Networks
- Evacuation modeling: a case study on linear and nonlinear network flow models
- On solving maximum and quickest interval-valued flows over time
- A comparison of phase and nonphase network flow algorithms
- A polynomial time algorithm for the minimum flow problem in time-varying networks
- scientific article; zbMATH DE number 3934807 (Why is no real title available?)
- Universally maximum flow with piecewise-constant capacities
- On solving continuous-time dynamic network flows
- On continuous network flows
- Existence and Uniqueness of Equilibria for Flows over Time
- Dynamic Atomic Congestion Games with Seasonal Flows
- 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
- Scalable timing-aware network design via Lagrangian decomposition
- Generalized maximum flow over time with intermediate storage
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
- Sink location problems in dynamic flow grid networks
- On verifying and maintaining connectivity of interval temporal networks
- An exact algorithm for the service network design problem with hub capacity constraints
- Bicriteria Nash flows over time
- Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
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)
