The auction algorithm for the transportation problem
type: Item
instance of: scholarly article
title: The auction algorithm for the transportation problem
zbMATH Open document ID: 0705.90061
DOI: 10.1007/BF02216923
author: Dimitri P. Bertsekas
author: David A. Castanon
published in: Annals of Operations Research
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 91B26
zbMATH DE Number: 4158380
zbMATH Keywords: auction algorithm
zbMATH Keywords: parallel relaxation method
zbMATH Keywords: assignment
zbMATH Keywords: competitive bidding
describes a project that uses: RELAX4
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: A competitive (dual) simplex method for the assignment problem
cites work: The alternating basis algorithm for assignment problems
cites work: A new algorithm for the assignment problem
cites work: A unified framework for primal-dual methods in minimum cost network flow problems
cites work: The auction algorithm: A distributed relaxation method for the assignment problem
cites work: Dual coordinate step methods for linear network flow problems
cites work: Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
cites work: Q4001523
cites work: A Successive Shortest Path Algorithm for The Assignment Problem
cites work: Efficient dual simplex algorithms for the assignment problem
cites work: Technical Note—A Polynomial Simplex Method for the Assignment Problem
cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems
cites work: Q3968758
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Q5519710
cites work: Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
cites work: Q4739657
cites work: Q3730336
full work available at URL: https://doi.org/10.1007/bf02216923
OpenAlex ID: W1964486323
Recommended article: A real‐valued auction algorithm for optimal transport
Recommended article: The stochastic bid generation problem in combinatorial transportation auctions
Recommended article: Q3362079
Recommended article: Approximation algorithms for the transportation problem with market choice and related models
Recommended article: An auction algorithm for the max-flow problem
Recommended article: An Auction Algorithm for Shortest Paths
Recommended article: An efficient bidding heuristic for simultaneous truckload transportation auctions
Recommended article: Auction algorithms for shortest hyperpath problems
Recommended article: The auction algorithm: A distributed relaxation method for the assignment problem
Recommended article: Q3614691
description: scientific article; zbMATH DE number 4158380