A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

DOI10.1016/j.orl.2008.01.011zbMath1155.90464OpenAlexW2089134982MaRDI QIDQ1003485

Ulrich Brenner

Publication date: 4 March 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.01.011

zbMATH Keywords

minimum cost flow problemHitchcock transportation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (8)

Scheduling last-mile deliveries with truck-based autonomous robots ⋮ Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey ⋮ Tropical medians by transportation ⋮ Tight Semi-model-free Bounds on (Bilateral) CVA ⋮ Dynamic Capacity Management with General Upgrading ⋮ A heuristic for obtaining better initial feasible solution to the transportation problem ⋮ Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs ⋮ Personnel scheduling and supplies provisioning in emergency relief operations

Cites Work

• Linear time algorithms for some separable quadratic programming problems
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• Geometric quadrisection in linear time, with application to VLSI placement
• A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
• Time bounds for selection
• A strongly polynomial algorithm for the transportation problem
• An O(n) algorithm for the multiple-choice knapsack linear program
• Finding Minimum-Cost Circulations by Successive Approximation
• An Algorithm for Large Zero-One Knapsack Problems
• A Linear Time Algorithm for a $2 \times n$ Transportation Problem
• Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
• Improved Algorithms for Bipartite Network Flow
• Efficient Algorithms for the Hitchcock Transportation Problem
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Combinatorial optimization. Theory and algorithms.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A faster polynomial algorithm for the unbalanced Hitchcock transportation problem