A strongly polynomial algorithm for the transportation problem
type: Item
instance of: scholarly article
title: A strongly polynomial algorithm for the transportation problem
zbMATH Open document ID: 0833.90084
DOI: 10.1007/BF01585755
author: H. Schannath
author: Peter Kleinschmidt
published in: Mathematical Programming. Series A. Series B
publication date: 1995-05-14T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 754870
zbMATH Keywords: strongly polynomial algorithm
zbMATH Keywords: linear transportation problem
zbMATH Keywords: excess scaling
MaRDI profile type: Publication
cites work: Improved Algorithms for Bipartite Network Flow
cites work: Signature Methods for the Assignment Problem
cites work: Solving the Assignment Problem by Relaxation
cites work: Transportation problems which can be solved by the use of hirsch-paths for the dual problems
Recommended article: Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
Recommended article: POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
Recommended article: Strongly polynomial algorithm for a production-transportation problem with concave production cost
Recommended article: A polynomial algorithm for an integer quadratic non-separable transportation problem
Recommended article: Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
Recommended article: Q3476209
Recommended article: A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Recommended article: A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
Recommended article: A polynomial algorithm for a constrained traveling salesman problem
Recommended article: An algorithm for semi-infinite transportation problems
description: scientific article; zbMATH DE number 754870