A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

DOI10.1016/J.ORL.2008.01.011MaRDI QIDQ1003485zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A linear time algorithm for the unbalanced Hitchcock transportation problem
• scientific article; zbMATH DE number 742962
• A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
• Efficient Algorithms for the Hitchcock Transportation Problem
• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS

Cites work

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

Cited in

(15)

• Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs
• A linear time algorithm for the unbalanced Hitchcock transportation problem
• Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey
• Dynamic capacity management with general upgrading
• scientific article; zbMATH DE number 5863215 (Why is no real title available?)
• Scheduling last-mile deliveries with truck-based autonomous robots
• Efficient Algorithms for the Hitchcock Transportation Problem
• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
• A heuristic for obtaining better initial feasible solution to the transportation problem
• Personnel scheduling and supplies provisioning in emergency relief operations
• Tight semi-model-free bounds on (bilateral) CVA
• Tropical medians by transportation
• A strongly polynomial algorithm for the transportation problem
• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
• scientific article; zbMATH DE number 742962 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003485)