Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- 1 October 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 19 (4) , 712-726
- https://doi.org/10.1145/321724.321734
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation AlgorithmJournal of the ACM, 1973
- An operator theory of parametric programming for the transportation problem‐INaval Research Logistics Quarterly, 1972
- An operator theory of parametric programming for the transportation problem‐IINaval Research Logistics Quarterly, 1972
- Letter to the Editor—Locating Stepping-Stone Paths in Distribution Problems Via the Predecessor Index MethodTransportation Science, 1970
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- Topology and Computation of the Generalized Transportation ProblemManagement Science, 1964
- Coding the transportation problemNaval Research Logistics Quarterly, 1960
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- A High-Speed Computer Technique for the Transportation ProblemJournal of the ACM, 1958
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956