scientific article; zbMATH DE number 742962

MaRDI QIDQ4763404zbMATHFDO

Authors Takeshi Tokuyama, Jun Nakano

Publication date 11 April 1995

zbMATH Keywords

Hitchcock transportation problemminimum-cost flow algorithmsplitter finding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)

Recommendations

• Efficient Algorithms for the Hitchcock Transportation Problem
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• A linear time algorithm for the unbalanced Hitchcock transportation problem
• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
• A strongly polynomial algorithm for the transportation problem

Cited in

(10)

• A linear time algorithm for the unbalanced Hitchcock transportation problem
• Splitting a configuration in a simplex
• Linear time algorithms for some separable quadratic programming problems
• Geometric algorithms for the minimum cost assignment problem
• Uniform capacitated facility location problem with random input data
• Faster algorithms for the geometric transportation problem
• Algorithms for the minimax transportation problem
• Using geometry to solve the transportation problem in the plane
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS

This page was built for publication:

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