Parallel network simplex algorithm for the minimum cost flow problem

In this work, we contribute a parallel implementation of the network simplex algorithm that is used for the solution of minimum cost flow problem. In the network simplex algorithm, finding an entering arc requires searching through many arcs to decide which one should be included in the spanning tre...

Celý popis

Podrobná bibliografia

Vydané v:	Concurrency and computation Ročník 34; číslo 4
Hlavní autori:	Kara, Gökçehan, Özturan, Can
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Wiley Subscription Services, Inc 15.02.2022
Predmet:	Algorithms block search pivoting rule Graph theory Minimum cost minimum cost flow problem network simplex algorithm shared memory parallelism Simplex method vectorization
ISSN:	1532-0626, 1532-0634
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!