Accession Number : AD0769677
Title : Implementation and Computational Comparisons of Primal, Dual and Primal-Dual Computer Codes for Minimum Cost Network Flow Problems.
Descriptive Note : Research rept.,
Corporate Author : TEXAS UNIV AUSTIN CENTER FOR CYBERNETIC STUDIES
Personal Author(s) : Glover,F. ; Karney,D. ; Klingman,D.
Report Date : JUL 1973
Pagination or Media Count : 38
Abstract : The paper presents extensive computational experience with a special purpose primal simplex algorithm. The performance is compared to that of several 'state of the art' out-of-kilter computer codes. The computational characteristics of several different primal feasible start procedures and pivot selection strategies are also examined. The study discloses the advantages, in both computation time and memory requirements, of the primal approach over the out-of-kilter method. The test environment has the following distinguishing properties: (1) all of the codes are tested on the same machine and the same problems, (2) the test set includes capacitated and uncapacitated transhipment networks, transportation problems, and assignment problems, and (3) problem sizes ranging from 100 to 8,000 nodes with up to 35,000 arcs are examined. (Author)
Descriptors : (*Network flows, Algorithms), Linear programming, Simplex method, Transportation, Mathematical models, Computer programming, Computations, FORTRAN
Subject Categories : Operations Research
Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE