DocumentCode
3426399
Title
Algorithms for quadratic transportation networks
Author
Ventura, Jose A.
Author_Institution
Dept. of Ind. & Manage. Syst. Eng., Pennsylvania State Univ., University Park, PA, USA
fYear
1989
fDate
13-15 Dec 1989
Firstpage
1131
Abstract
Two dual algorithms for solving quadratic transportation problems are discussed and compared. Both algorithms include a similar line search subproblem. The performance of the algorithms is improved by combining two known line search techniques, the Bitran-Hax line search algorithm and the sequential line search algorithm. Results of a computational study carried out to identify the best method to solve quadratic transportation problems are presented
Keywords
duality (mathematics); matrix algebra; minimisation; search problems; transportation; Bitran-Hax line search algorithm; dual algorithms; matrix algebra; minimisation; quadratic transportation networks; sequential line search algorithm; Engineering management; Equations; Iterative algorithms; Lagrangian functions; Matrix decomposition; Search methods; Statistics; Supply and demand; Systems engineering and theory; Transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1989., Proceedings of the 28th IEEE Conference on
Conference_Location
Tampa, FL
Type
conf
DOI
10.1109/CDC.1989.70310
Filename
70310
Link To Document