Sink location problems in dynamic flow networks
From MaRDI portal
Cites work
- A faster algorithm for quickest transshipments via an extended discrete Newton method
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Constructing maximal dynamic flows from static flows
- Discrete Newton methods for the evacuation problem
- Efficient continuous-time dynamic network flow algorithms
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
- Finding the upper envelope of n line segments in O(n log n) time
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- Improved algorithms for optimal k sink location on path networks
- Locating evacuation centers optimally in path and cycle networks
- Minimax regret 1-sink location problems in dynamic path networks
- Minimax regret sink location problem in dynamic tree networks with uniform capacity
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- Multiple sink location problems in dynamic path networks
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Sink location problems in dynamic flow grid networks
- The quickest transshipment problem
This page was built for publication: Sink location problems in dynamic flow networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396341)
