A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM

DOI10.15807/JORSJ.30.265zbMath0641.90038OpenAlexW2187985096MaRDI QIDQ3783057

Akira Nakayama

Publication date: 1987

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.30.265

zbMATH Keywords

minimum cost flowpolynomial-time dual simplex algorithmtwo-terminal capacitated network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Deterministic network models in operations research (90B10)

This page was built for publication: A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM