| Autor: |
Olof Damberg, Sverre Storøy, Athanasios Migdalas |
| Rok vydání: |
1997 |
| Předmět: |
|
| Zdroj: |
Applied Optimization ISBN: 9781461334026 |
| DOI: |
10.1007/978-1-4613-3400-2_6 |
| Popis: |
In this chapter we review parallel algorithms for some linear network problems, with special emphasis on the bipartite assignment problem. The many-to-one assignment problem is considered, and a breadth-first-search algorithm for finding augmenting paths is exemplified. We also review parallel algorithms for single- and multicommodity network problems with convex objective functions. A simplicial decomposition approach to the traffic assignment problem is presented and an SPMD implementation is given. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
