POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS

DOI10.15807/JORSJ.32.371zbMATH Open0716.90079OpenAlexW291496133MaRDI QIDQ3204329FDOQ3204329

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

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

zbMATH Keywords

Hitchcock transportation problempolynomial time interior point algorithms

Mathematics Subject Classification ID

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

Cited In (13)

• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• Title not available (Why is that?)
• On polynomial solvability of the decentralized transportation problem with block matrices of profits of customers
• Determination of optimal vertices from feasible solutions in unimodular linear programming
• Extremal Points and an Algorithm for a Class of Continuous Transportation Problems
• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
• An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
• A strongly polynomial algorithm for the transportation problem
• Exploiting special structure in a primal-dual path-following algorithm
• Efficient Algorithms for the Hitchcock Transportation Problem
• Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
• Title not available (Why is that?)
• Preconditioning for the Geometric Transportation Problem

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)