Efficient algorithm for Minimum cost flow problem with partial lane reversals

  • Urmila Pyakurel Tribhuvan University, PO Box 13143, Kathmandu, Nepal
Keywords: Minimum cost flow, partial contraflow, efficient algorithm, complexity

Abstract

In this paper, we investigate the minimum cost flow problem in two terminal series parallel network. We present modified minimum cost flow algorithm that computes the maximum dynamic and the earliest arrival flows in strongly polynomial time and also preserves all unused arc capacities. We also present strongly polynomial time minimum cost partial contraflow algorithm that solves both problems with partial reversals of arc capacities on two terminal series parallel networks.

Downloads

Download data is not yet available.
Abstract
45
PDF
21

Author Biography

Urmila Pyakurel, Tribhuvan University, PO Box 13143, Kathmandu, Nepal

Central Department of Mathematics

Published
2019-12-31
How to Cite
Pyakurel, U. (2019). Efficient algorithm for Minimum cost flow problem with partial lane reversals. The Nepali Mathematical Sciences Report, 36(1-2), 51-59. https://doi.org/10.3126/nmsr.v36i1-2.29970
Section
Articles