POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS

DOI10.15807/jorsj.32.371zbMath0716.90079OpenAlexW291496133MaRDI QIDQ3204329

Kaori Masuzawa, Shinji Mizuno

Publication date: 1989

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

Full work available at URL: https://semanticscholar.org/paper/c2ca41cb17300c98963f281a43a251b33d632b14

zbMATH Keywords

Hitchcock transportation problempolynomial time interior point algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Determination of optimal vertices from feasible solutions in unimodular linear programming ⋮ Exploiting special structure in a primal-dual path-following algorithm

This page was built for publication: POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS