A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS

DOI10.15807/JORSJ.33.157MaRDI QIDQ3202103zbMATH OpenOpenAlexFDO

Authors Kaori Masuzawa, Shinji Mizuno, Masao Mori

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

zbMATH Keywords

minimum cost flowconnected digraphpolynomial time interior point algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A combinatorial interior point method for network flow problems
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• scientific article; zbMATH DE number 150473
• On dual minimum cost flow algorithms
• Combinatorial interior point methods for generalized network flow problems

Cited in

(10)

• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
• Combinatorial interior point methods for generalized network flow problems
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
• Determination of optimal vertices from feasible solutions in unimodular linear programming
• A Simple Efficient Interior Point Method for Min-Cost Flow
• Solving integer minimum cost flows with separable convex cost objective polynomially
• Exploiting special structure in a primal-dual path-following algorithm
• scientific article; zbMATH DE number 6402605 (Why is no real title available?)
• A combinatorial interior point method for network flow problems
• New polynomial-time cycle-canceling algorithms for minimum-cost flows

This page was built for publication: A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS

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