L. Fleischer  Home/Search
Context Related
| cornell.edu/pub/techreps/TR1190.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 128.227.36.67/InformsArc...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A transshipment problem with demands that exceed network capacity can be solved by sending flow in several waves. How can this be done using the minimum number of iterations? This is the question tackled in the quickest transshipment problem. Hoppe and Tardos [8] describe the only known polynomial time algorithm that finds an integral solution to this problem. Their algorithm repeatedly minimizes submodular functions using the ellipsoid method, and is therefore not at all practical. I... (Update)
Context of citations to this paper: More
...generalizes this result to solve the problem where the edge and storage capacities are piecewise constant functions of time. Fleischer [6] describes a faster algorithm to solve the Hajek Ogier problem and some also presents algorithms for some related dynamic flow problems....
...can be solved in the same asymptotic time as one minimum (convex) cost flow computation. This improves upon the recent algorithm in [5]which solves the quickest transshipment problem (the above mentioned problem without costs) on k terminals using k log T maximum flow...
Cited by: More
Quickest Flows Over Time - Fleischer, Skutella (Correct)
The Quickest Transshipment Problem - Bruce Hoppe Eva (1995) (Correct)
Universally Maximum Flow with Piecewise-Constant Capacities - Fleischer (1998) (Correct)
Similar documents (at the sentence level):
54.9%: Faster Algorithms for the Quickest Transshipment Problem - L. Fleischer (1997) (Correct)
Active bibliography (related documents): More All
0.8: Optimal Rounding of Fractional Dynamic Flows when.. - L. Fleischer, J. B.. (1997) (Correct)
0.7: Efficient Continuous-Time Dynamic Network Flow Algorithms - Fleischer, Tardos (1998) (Correct)
0.6: Optimal Rounding of Instantaneous Fractional Flows Over Time - Fleischer, Orlin (1999) (Correct)
Similar documents based on text: More All
0.5: A Practical Module-Based Simulation Model For.. - Takakuwa (1999) (Correct)
0.4: Polynomial Dual Network Simplex Algorithms - Orlin, Plotkin, Tardos (1991) (Correct)
Related documents from co-citation: More All
6: A survey of dynamic network flows (context) - Aronson - 1989
6: Optimal dynamic routing in communication networks with continuous traffic (context) - Hajek, Ogier - 1984
6: Stochastic and dynamic networks and routing (context) - Powell, Jaillet et al. - 1995
BibTeX entry: (Update)
L. Fleischer. Faster algorithms for the quickest transshipment problem. In Proceedings of the Ninth Annual ACM/SIAM Symposium on Discrete Algorithms, 1998. To appear. http://citeseer.ist.psu.edu/fleischer97faster.html More
@inproceedings{ fleischer98faster,
author = "Fleischer",
title = "Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1998",
url = "citeseer.ist.psu.edu/fleischer97faster.html" }
Citations (may not include all citations):303 Princeton University Press (context) - Ford, Fulkerson et al. - 1962
185 Applying parallel computation algorithms in the design of se.. (context) - Megiddo - 1983
65 Combinatorial optimization with rational objective functions (context) - Megiddo - 1979
38 Linear Programming in Infinite-Dimensional Spaces (context) - Anderson, Nash - 1987
34 A fast parametric maximum flow algorithm and applications (context) - Gallo, Grigoriadis et al. - 1989
30 Stochastic and dynamic networks and routing (context) - Powell, Jaillet et al. - 1995
22 The quickest transshipment problem - Hoppe, Tardos - 1995
18 A survey of dynamic network flows (context) - Aronson - 1989
14 Optimal dynamic routing in communication networks with conti.. (context) - Hajek, Ogier - 1984
11 Optimal flows in networks with multiple sources and sinks (context) - Megiddo - 1974
9 An algorithm for a class of continuous linear programs (context) - Pullan - 1993
7 A continuous-time network simplex algorithm (context) - Anderson, Philpott - 1989
7 Mathematics of Operations Research (context) - Philpott, in - 1990
6 Efficient continuous time dynamic network flow algorithms - Fleischer, Tardos - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://128.227.36.67/InformsArchive/papers.html): More
Notes on Median and Quantile Estimation with Applications - Huber (1998) (Correct)
A Performance Evaluation of Online Warehouse Update.. - Labrinidis, Roussopoulos (1998) (Correct)
A Genetic Algorithm for a. . . - Herrmann (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC