A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
type: Item
instance of: scholarly article
title: A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
zbMATH Open document ID: 1155.90464
author: Ulrich Brenner
published in: Operations Research Letters
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5522978
zbMATH Keywords: Hitchcock transportation problem
zbMATH Keywords: minimum cost flow problem
MaRDI profile type: Publication
full work available at URL: j.orl.2008.01.011
OpenAlex ID: W2089134982
cites work: A Linear Time Algorithm for a $2 \times n$ Transportation Problem
cites work: Q3056948
cites work: Improved Algorithms for Bipartite Network Flow
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Time bounds for selection
cites work: An O(n) algorithm for the multiple-choice knapsack linear program
cites work: Q5514188
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
cites work: Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
cites work: A strongly polynomial algorithm for the transportation problem
cites work: Combinatorial optimization. Theory and algorithms.
cites work: Linear time algorithms for some separable quadratic programming problems
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: Efficient Algorithms for the Hitchcock Transportation Problem
cites work: Q4360320
cites work: Geometric quadrisection in linear time, with application to VLSI placement
cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems
DOI: 10.1016/J.ORL.2008.01.011
description: scientific article; zbMATH DE number 5522978