Regular ArticleAn Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm☆
References (37)
- et al.
Network flows
Optimization. Handbooks in Operations Research and Management Science
(1989) - et al.
Goldberg's algorithm for the maximum flow in perspective: A computational study
- D. P. Bertsekas, 1986, Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems, Laboratory for...
- et al.
Relaxation methods for minimum cost ordinary and generalized network flow problems
Oper. Res.
(1988) - et al.
An empirical study of min cost flow algorithms
- et al.
On the computational behavior of a polynomial-time network flow algorithm
Math. Prog.
(1992) - et al.
Design and implementation of large scale transportation algorithms
Management Sci.
(1977) - et al.
An improved primal simplex variant for pure processing networks
ACM Trans. Math. Software
(1989) - B. V. Cherkassky,...
- B. V. Cherkassky, A. V. Goldberg, 1994, On Implementing Push-Relabel Method for the Maximum Flow Problem, Department of...
Implementing Goldberg's max-flow algorithm—A computational investigation
ZOR—Methods Models Oper. Res.
(1989)
Goldrmf/Goldnet-max-flow program
Europ. J. Oper Res.
(1990)
Algorithm 360: Shortest path forest with topological ordering
Commun. ACM
(1969)
Flows in Networks
(1962)
A speculative contraction method for the minimum cost flows: Toward a practical algorithm
Implementation and computational comparison of primal, dual, and primal–dual computer codes for minimum cost network flow problem
Networks
(1974)
Cited by (299)
Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport
2024, EURO Journal on Transportation and LogisticsConflict-tolerant and conflict-free multi-agent meeting
2023, Artificial IntelligenceInventory allocation with full downward substitution and monotone cost differences
2023, European Journal of Operational ResearchA parameterized lower bounding method for the open capacitated arc routing problem
2023, EURO Journal on Computational OptimizationA solution approach to minimal average cost flow problem with lower and upper bounds on flows
2022, Expert Systems with ApplicationsResearch on performance optimization of virtual data space across WAN
2024, Frontiers of Computer Science
- ☆
G. L. NemhauserA. H. G. Rinnooy KanM. J. Todd, Eds.
- *
Most of this work was done while the author was at the Stanford University Computer Science Department and supported in part by ONR Young Investigator Award N00014-91-J-1855, NSF Presidential Young Investigator Grant CCR-8858097 with matching funds from AT&T and DEC, Stanford University Office of Technology Licensing, and a grant from the Powell Foundation.
Copyright © 1997 Academic Press. All rights reserved.