Algorithms for quadratic transportation networks

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)1131-1135
Number of pages5
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 1989
EventProceedings of the 28th IEEE Conference on Decision and Control. Part 2 (of 3) - Tampa, FL, USA
Duration: Dec 13 1989Dec 15 1989

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization


Dive into the research topics of 'Algorithms for quadratic transportation networks'. Together they form a unique fingerprint.

Cite this