A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
type: Item
instance of: scholarly article
title: A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
zbMATH Open document ID: 0886.90168
DOI: 10.1023/A:1008278625289
author: Takahito Kuno
author: Takahiro Utsunomiya
published in: Journal of Global Optimization
publication date: 1998-05-12T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 1054581
zbMATH Keywords: pseudo-polynomial algorithm
zbMATH Keywords: primal-dual algorithm
zbMATH Keywords: production-transportation problems
zbMATH Keywords: minimum linear-cost flow problem
MaRDI profile type: Publication
full work available at URL: a:1008278625289
OpenAlex ID: W1492736567
Recommended article: A pseudo-polynomial algorithm for solving rank three concave production-transportation problems
Recommended article: A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
Recommended article: Strongly polynomial algorithm for a production-transportation problem with concave production cost
Recommended article: A Lagrangian based branch-and-bound algorithm for production-transportation problems
Recommended article: Q4864972
Recommended article: A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost
Recommended article: A Treatment of Transportation Problems by Primal Partition Programming
Recommended article: A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
Recommended article: Solution of large dense transportation problems using a parallel primal algorithm
description: scientific article; zbMATH DE number 1054581