A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
From MaRDI portal
Publication:1003485
DOI10.1016/J.ORL.2008.01.011zbMATH Open1155.90464OpenAlexW2089134982MaRDI QIDQ1003485FDOQ1003485
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
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
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Network flows. Theory, algorithms, and applications.
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Combinatorial optimization. Theory and algorithms.
- Finding Minimum-Cost Circulations by Successive Approximation
- Title not available (Why is that?)
- An Algorithm for Large Zero-One Knapsack Problems
- A strongly polynomial algorithm for the transportation problem
- Time bounds for selection
- An O(n) algorithm for the multiple-choice knapsack linear program
- Linear time algorithms for some separable quadratic programming problems
- Improved Algorithms for Bipartite Network Flow
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- Title not available (Why is that?)
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
- Efficient Algorithms for the Hitchcock Transportation Problem
- Geometric quadrisection in linear time, with application to VLSI placement
- A Linear Time Algorithm for a $2 \times n$ Transportation Problem
Cited In (15)
- Personnel scheduling and supplies provisioning in emergency relief operations
- Tight semi-model-free bounds on (bilateral) CVA
- A linear time algorithm for the unbalanced Hitchcock transportation problem
- Scheduling last-mile deliveries with truck-based autonomous robots
- Title not available (Why is that?)
- 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
- Dynamic capacity management with general upgrading
- A strongly polynomial algorithm for the transportation problem
- Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey
- Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs
- Efficient Algorithms for the Hitchcock Transportation Problem
- Title not available (Why is that?)
- Tropical medians by transportation
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
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)
