The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
The Quickest Transshipment Problem
Abstract
A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is defined by a dynamic network with several sources and sinks; each source has a specified supply and each sink has a specified demand. The problem is to send exactly the right amount of flow out of each source and into each sink in the minimum overall time. Variations of the quickest transshipment problem have been studied extensively; the special case of the problem with a single sink is commonly used to model building evacuation. Similar dynamic network flow problems have numerous other applications; in some of these, the capacities are small integers and it is important to find integral flows. There are no polynomial-time algorithms known for most of these problems. In this paper we give the first polynomial-time algorithm for the quickest transshipment problem. Our algorithm provides an integral optimum flow. Previously, the quickest transshipment problem could only be solved efficiently in the special case of a single source and single sink.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
Ford, L. R., & Fulkerson, D. R. (1963) · Princeton University Press eBooks · doi:10.1515/9781400875184 · Cited by 891
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Megiddo, N. (1983) · Journal of the ACM · doi:10.1145/2157.322410 · Cited by 626
Combinatorial Optimization with Rational Objective Functions
Megiddo, N. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.4.414 · Cited by 473
A Fast Parametric Maximum Flow Algorithm and Applications
Gallo, G., Grigoriadis, M. D., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218003 · Cited by 427
Chapter 3 Stochastic and dynamic networks and routing
Powell, W. B., Jaillet, P., & Odoni, A. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80107-0 · Cited by 334
Network Models for Building Evacuation
Chalmet, L. G., Francis, R. L., & Saunders, P. B. (1982) · Management Science · doi:10.1287/mnsc.28.1.86 · Cited by 256
Optimal flows in networks with multiple sources and sinks
Megiddo, N. (1974) · Mathematical Programming · doi:10.1007/bf01585506 · Cited by 216
Cited by
A Spatial Access-Oriented Implementation of a 3-D GIS Topological Data Model for Urban Entities
Lee, J. (2004) · GeoInformatica · doi:10.1023/b:gein.0000034820.93914.d0 · Cited by 200
Metadata
- Authors
- Hoppe, B., & Tardos, É.
- Venue
- Mathematics of Operations Research
- Published
- 2000-02
- Volume
- 25
- Issue
- 1
- Pages
- 36-62
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2170193147
- Cited by
- 310
- References
- 11
- FWCI
- 8.10
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Quickest Transshipment Problem. https://app.cochat.ai/papers/10.1287/moor.25.1.36.15211
- The paper
- Hoppe, B., & Tardos, É. (2000). The Quickest Transshipment Problem. Mathematics of Operations Research. https://doi.org/10.1287/moor.25.1.36.15211
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.