Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- 1 February 1979
- journal article
- research article
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 17 (1) , 16-34
- https://doi.org/10.1080/03155986.1979.11731713
Abstract
New labelling techniques are provided for accelerating the basis exchange step of specialized linear programming methods for network problems. Computational results are presented which show that these techniques substantially reduce the amount of computation involved in updating operations.Keywords
This publication has 8 references indexed in Scilit:
- An improved version of the out-of-kilter method and a comparative study of computer codesMathematical Programming, 1974
- Augmented Threaded Index Method For Network OptimizationINFOR: Information Systems and Operational Research, 1974
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network ProblemsManagement Science, 1974
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation ProblemsManagement Science, 1974
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution ProblemsJournal of the ACM, 1972
- The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution ProblemsTransportation Science, 1972
- Networks and Basic SolutionsOperations Research, 1966