Document
About this Digital Document
Computational efficiencies of the primal-dual algorithm and the uv-method in solving transportation problems are compared in this thesis. A computer program was written in Fortran IV and run on the CDC 6400 system; it generated random problems with integer constants ranging in the size from 5X10 to 30 X 50, and solved them by both methods.
Full Title
On the computational efficiencies of the primal-dual algorithm and the uv-method for solving transportation problems
Member of
Contributor(s)
Creator: Algon, Taylan
Thesis advisor: Richardson, Wallace J.
Publisher
Lehigh University
Date Issued
1970-09
Language
English
Type
Genre
Form
electronic documents
Department name
Industrial Engineering
Digital Format
electronic documents
Media type
Creator role
Graduate Student
Identifier
1048261753
https://asa.lib.lehigh.edu/Record/10947094
Keywords
Algon, . T. (1970). On the computational efficiencies of the primal-dual algorithm and the uv-method for solving transportation problems (1–). https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/computational-7
Algon, Taylan. 1970. “On the Computational Efficiencies of the Primal-Dual Algorithm and the Uv-Method for Solving Transportation Problems”. https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/computational-7.
Algon, Taylan. On the Computational Efficiencies of the Primal-Dual Algorithm and the Uv-Method for Solving Transportation Problems. Sept. 1970, https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/computational-7.
