A streamlined simplex approach to the singly constrained transportation problem

DOI10.1002/NAV.3800250410zbMATH Open0395.90052OpenAlexW2008188146MaRDI QIDQ4178779FDOQ4178779

Authors: Darwin D. Klingman, Robert A. Russell 

Publication date: 1978

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800250410

zbMATH Keywords

Simplex AlgorithmComputational EfficiencyLinear ProgrammingDouble Reverse MethodSingly Constrained Transportation Problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Title not available (Why is that?)
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• A High-Speed Computer Technique for the Transportation Problem

Cited In (5)

• Dynamic factorization in large-scale optimization
• A specialized network simplex algorithm for the constrained maximum flow problem
• A network simplex method for the budget-constrained minimum cost flow problem
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• The singly constrained assignment problem: An AP basis algorithm

This page was built for publication: A streamlined simplex approach to the singly constrained transportation problem

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