Survey of Deterministic Networks
- 1 September 1975
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 7 (3) , 222-234
- https://doi.org/10.1080/05695557508975006
Abstract
The state-of-the-art of deterministic networks is surveyed with a discussion of shortest path, transportation, assignment, transshipment, maximum flow, minimum spanning tree, Chinese postman, Euler path and multicommodity flow models. The computational complexity of network models is discussed. The survey concentrates on models and algorithms that can be used to solve large-scale problems.Keywords
This publication has 55 references indexed in Scilit:
- Efficient computational devices for the capacitated transportation problemNaval Research Logistics Quarterly, 1974
- A fundamental problem in vehicle routingNetworks, 1974
- Networks and vehicle routing for municipal waste collectionNetworks, 1974
- A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N -Node Nonnegative-Distance NetworksJournal of the ACM, 1973
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation AlgorithmJournal of the ACM, 1973
- Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½
N
3
Additions and
N
3
ComparisonsJournal of the ACM, 1972
- Optimal multicommodity network flows with resource allocationNaval Research Logistics Quarterly, 1970
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955
- Linear programming in bid evaluationNaval Research Logistics Quarterly, 1954