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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1131-1135 |
| Number of pages | 5 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 2 |
| State | Published - 1989 |
| Event | Proceedings of the 28th IEEE Conference on Decision and Control. Part 2 (of 3) - Tampa, FL, USA Duration: Dec 13 1989 → Dec 15 1989 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization
Fingerprint
Dive into the research topics of 'Algorithms for quadratic transportation networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver