A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
type: Item
instance of: scholarly article
title: A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
zbMATH Open document ID: 0956.90019
DOI: 10.1016/S0167-6377(98)00053-4
author: Dorit S. Hochbaum
author: Gerhard J. Woeginger
published in: Operations Research Letters
publication date: 1999-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1347064
zbMATH Keywords: transportation problem
zbMATH Keywords: bottleneck cost
zbMATH Keywords: bottleneck transportation problem
zbMATH Keywords: linear-time algorithm
MaRDI profile type: Publication
cites work: A Linear Time Algorithm for a $2 \times n$ Transportation Problem
cites work: Q4091421
cites work: Time bounds for selection
cites work: An augmenting path method for solving linear bottleneck transportation problems
cites work: An O(n) algorithm for the multiple-choice knapsack linear program
cites work: Submodular functions and optimization
cites work: A theorem on flows in networks
cites work: The bottleneck transportation problem
cites work: Fast Algorithms for Bipartite Network Flow
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: Q4040221
cites work: An instant solution of the \(2\times n\) bottleneck transportation problem
cites work: A Short Proof of the Factor Theorem for Finite Graphs
cites work: An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems
full work available at URL: s0167-6377(98)00053-4
OpenAlex ID: W1967185041
description: scientific article; zbMATH DE number 1347064