Cost operator algorithms for the transportation problem

DOI10.1007/BF01593805zbMATH Open0362.90058OpenAlexW2013108254MaRDI QIDQ4136922FDOQ4136922

Author name not available (Why is that?)

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• The transhipment problem
• Some remarks on the time transportation problem
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• An operator theory of parametric programming for the transportation problem-I

Cited In (6)

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

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

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