Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
type: Item
instance of: scholarly article
title: Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
zbMATH Open document ID: 0587.90068
DOI: 10.1016/0166-218X(86)90085-5
author: Yoshiro Ikura
author: G. L. Nemhauser
published in: Discrete Applied Mathematics
publication date: 1986-01-01T00:00:00Z
review text: This paper reports on the implementation and computational experience obtained with a polynomial-time dual simplex algorithm for the transportation problem. The polynomial-time version of the algorithm is shown to be empirically, as well as theoretically, more efficient than a standard version. In particular, scaling of the supplies and demands is very effective computationally.
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3943554
zbMATH Keywords: implementation
zbMATH Keywords: computational experience
zbMATH Keywords: polynomial-time dual simplex algorithm
zbMATH Keywords: transportation problem
zbMATH Keywords: scaling of the supplies and demands
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
cites work: Q3968758
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Q3048571
description: scientific article; zbMATH DE number 3943554