Cost operator algorithms for the transportation problem

DOI10.1007/BF01593805zbMath0362.90058OpenAlexW2013108254MaRDI QIDQ4136922

No author found.

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01593805

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (6)

A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies ⋮ A gradient driven transportation algorithm ⋮ Improving bipartite graph edit distance approximation using various search strategies ⋮ A genuinely polynomial primal simplex algorithm for the assignment problem ⋮ A polynomial algorithm for minimum quadratic cost flow problems ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Cites Work

• Unnamed Item
• Unnamed Item
• The Transhipment Problem
• An operator theory of parametric programming for the transportation problem-I
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Some remarks on the time transportation problem
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

This page was built for publication: Cost operator algorithms for the transportation problem