A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
From MaRDI portal
Publication:3202103
DOI10.15807/jorsj.33.157zbMath0715.90046OpenAlexW2135795094MaRDI QIDQ3202103
Kaori Masuzawa, Masao Mori, Shinji Mizuno
Publication date: 1990
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.33.157
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (3)
Determination of optimal vertices from feasible solutions in unimodular linear programming ⋮ A combinatorial interior point method for network flow problems ⋮ Exploiting special structure in a primal-dual path-following algorithm
This page was built for publication: A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
