Journal Article10.1287/OPRE.20.1.109
A Noniterative Algorithm for Tridiagonal Transportation Problems and Its Generalization
TL;DR: The algorithm presented here works by eliminating all off-diagonal variables in terms of the diagonal ones, and then specifying values for the diagonal variables for tridiagonal problems in n steps for an n-origin, n-destination problem.
read more
Abstract: Some transportation problems are such that, when origins and destinations are suitably indexed, the cost matrix contains elements along the main diagonal, a band above it, and a band below it, whil...
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
More-for-less algorithm for fixed-charge transportation problems
TL;DR: A simple heuristic algorithm is developed to identify the demand destinations and the supply points to ship MFL in FCTPs and can serve as an effective tool for managers for solving the more-for-less paradox for large distribution problems.
67
Solving transportation problems with mixed constraints
TL;DR: This paper provides a heuristic algorithm for solving transportation problems with mixed constraints and extends the algorithm to find a more-for-less (MFL) solution, if one exists.
Monge and feasibility sequences in general flow problems
TL;DR: The characterization and algorithms are extended to general minimum cost flow problems in which the underlying graph is nonbipartite, and the sources and destinations are not predetermined and the theory of Monge sequences is generalized to such problems.
15
A New Method for Finding an Optimal More- For-Less Solution of Transportation Problems with Mixed Constraints
P. Pandian,Govindarajan Natarajan +1 more
- 01 Jan 2010
TL;DR: In this paper, a new method called zero point method is proposed for finding an optimal solution for transportation problems with mixed constraints in a single stage, which is illustrated with numerical examples.
Fourier Method for Solving Transportation Problems with Mixed Constraints
P. Pandian,Govindarajan Natarajan +1 more
- 01 Jan 2010
TL;DR: In this article, a new method called, Fourier transportation algorithm based on Modified Fourier Elimination method is proposed for finding an optimal solution of transportation problems with mixed constraints, this method is very easy to understand and apply which can serve managers by providing the optimal solution to a variety of distribution problems.
References
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
•Book
Linear Programming and Extensions
George B. Dantzig
- 01 Jan 1963
TL;DR: This classic book looks at a wealth of examples and develops linear programming methods for their solutions and begins by introducing the basic theory of linear inequalities and describes the powerful simplex method used to solve them.
6.1K
Algorithms for the Assignment and Transportation Problems
TL;DR: In this paper, algorithms for the solution of the general assignment and transportation problems are presen, and the algorithm is generalized to one for the transportation problem.
Partitioning procedures for solving mixed-variables programming problems
TL;DR: In this article, the 8th International Meeting of the Institute of Management Sciences, Brussels, August 23-26, 1961, the authors presented a paper entitled "The International Journal of Management Science and Management Sciences".
3.5K