A strongly polynomial algorithm for the transportation problem
From MaRDI portal
Recommendations
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
- scientific article; zbMATH DE number 4145239
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- A polynomial algorithm for a constrained traveling salesman problem
- An algorithm for semi-infinite transportation problems
Cites work
Cited in
(40)- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
- Ergonomic workplace design in the fast pick area
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- Scheduling last-mile deliveries with truck-based autonomous robots
- First-order dominance: stronger characterization and a bivariate checking algorithm
- Two level hierarchical time minimizing transportation problem
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- Coordination mechanisms for parallel machine scheduling
- Uniform capacitated facility location problem with random input data
- Rényi 100, quantitative and qualitative (in)dependence
- Covering partially directed graphs with directed paths
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
- scientific article; zbMATH DE number 5863215 (Why is no real title available?)
- scientific article; zbMATH DE number 1003275 (Why is no real title available?)
- An iterative algorithm for two level hierarchical time minimization transportation problem
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
- Optimal radio resources and transmission formats assignment in OFDMA systems
- scientific article; zbMATH DE number 4145239 (Why is no real title available?)
- A Note on the Complexity of a Simple Transportation Problem
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Bounding wrong-way risk in CVA calculation
- scientific article; zbMATH DE number 742962 (Why is no real title available?)
- On the transportation problem with market choice
- scientific article; zbMATH DE number 847159 (Why is no real title available?)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- A solution concept related to ``bounded rationality for some two-echelon models
- Computing probabilistic bisimilarity distances for probabilistic automata
- A strongly polynomial time algorithm for an LP problem with a pre-Leontief coefficient matrix
- Computing probabilistic bisimilarity distances for probabilistic automata
- Tropical medians by transportation
- A solution technique for capacitated two-level hierarchical time minimization transportation problem
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
- Finding a b-matching that embeds the maximum number of edge pairs in a given set
- An efficient solution approach to capacitated bilevel time minimizing transportation problem
- Bilevel time minimizing transportation problem
This page was built for publication: A strongly polynomial algorithm for the transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804365)
