scientific article; zbMATH DE number 742962

zbMATH Open0818.90045MaRDI QIDQ4763404FDOQ4763404

Jun Nakano, Takeshi Tokuyama

Publication date: 11 April 1995

Title of this publication is not available (Why is that?)

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)

Cited In (6)

• Algorithms for the minimax transportation problem
• Using geometry to solve the transportation problem in the plane
• Splitting a configuration in a simplex
• Linear time algorithms for some separable quadratic programming problems
• Uniform capacitated facility location problem with random input data
• Geometric algorithms for the minimum cost assignment problem

Recommendations

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

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)