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...

Full description

Bibliographic Details

Published in:	Concurrency and computation Vol. 34; no. 4
Main Authors:	Kara, Gökçehan, Özturan, Can
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 15.02.2022
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!