POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS

DOI10.15807/JORSJ.32.371MaRDI QIDQ3204329zbMATH OpenOpenAlexFDO

Authors Shinji Mizuno, Kaori Masuzawa

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

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

Recommendations

• A strongly polynomial algorithm for the transportation problem
• scientific article; zbMATH DE number 742962
• A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• scientific article; zbMATH DE number 1200264

Cited in

(15)

• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
• Exploiting special structure in a primal-dual path-following algorithm
• A strongly polynomial algorithm for the transportation problem
• Determination of optimal vertices from feasible solutions in unimodular linear programming
• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
• scientific article; zbMATH DE number 4145239 (Why is no real title available?)
• Extremal Points and an Algorithm for a Class of Continuous Transportation Problems
• scientific article; zbMATH DE number 1200264 (Why is no real title available?)
• Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
• scientific article; zbMATH DE number 742962 (Why is no real title available?)
• Efficient Algorithms for the Hitchcock Transportation Problem
• An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
• Preconditioning for the Geometric Transportation Problem
• On polynomial solvability of the decentralized transportation problem with block matrices of profits of customers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204329)