Universally maximum flow with piecewise-constant capacities

@article{Fleischer2001UniversallyMF,
  title={Universally maximum flow with piecewise-constant capacities},
  author={Lisa Fleischer},
  journal={Networks},
  year={2001},
  volume={38},
  pages={115-125}
}
A maximum flow over time generalizes standard maximum flow by introducing a time component. The object is to send as much flow from source to sink in T time units as possible, where capacities are interpreted as an upper bound on the rate of flow entering an arc. A related problem is the universally maximum flow, which is to send a flow from source to sink that maximizes the amount of flow arriving at the sink by time t simultaneously for all t ≤ T. We consider a further generalization of this… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

Evacuation by Earliest Arrival Flows

View 16 Excerpts
Highly Influenced

Emergency Management System for Major Traffic Accidents Based on New Model and Algorithms

2009 International Forum on Computer Science-Technology and Applications • 2009
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Efficient dynamic network flow algorithms

B. Hoppe
PhD Thesis, • 1995
View 4 Excerpts
Highly Influenced

The Quickest Transshipment Problem

SODA • 1995
View 5 Excerpts
Highly Influenced

Flows in networks

L. R. Ford, D. R. Fulkerson
Princeton University Press, Princeton, NJ • 1962
View 3 Excerpts
Highly Influenced

Faster Algorithms for the Quickest Transshipment Problem

SIAM Journal on Optimization • 2001
View 2 Excerpts

Fast algorithms for parametric scheduling come from extensions to parametric maximum flow

S. T. McCormick
Oper Res 47 • 1999
View 2 Excerpts

Similar Papers

Loading similar papers…