Solution of constrained generalized transportation problems using the pivot and probe algorithm

DOI10.1016/0305-0548(86)90059-6zbMath0614.90075OpenAlexW2025387250MaRDI QIDQ1820696

Gerald L. Thompson, Awanti P. Sethi

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Solution_of_constrained_generalized_transportation_problems_using_the_pivot_and_probe_algorithm/6708035

zbMATH Keywords

computational experienceside constraintspivot and probe algorithmgeneralized transportation problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (6)

Network flow problems with one side constraint: A comparison of three solution methods ⋮ Transportation problem with nonlinear side constraints a branch and bound approach ⋮ A survey of dynamic network flows ⋮ SMT production scheduling: a generalized transportation approach ⋮ The pivot and probe algorithm for solving a linear program ⋮ Probing through the intersection of hyperplanes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving embedded generalized network problems
• Solving singularly constrained generalized network problems
• Solving Generalized Networks
• An operator theory of parametric programming for the generalized transportation problem: I. Basic theory
• An operator theory of parametric programming for the generalized transportation problem: II Rim, cost and bound operators
• An operator theory of parametric programming for the generalized transportation problem-III-weight operators
• An operator theory of parametric programming for the generalized transportation problem—IV—global operators
• Solving Constrained Transportation Problems
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• The pivot and probe algorithm for solving a linear program
• On the Generalized Transportation Problem
• The Generalized Stepping Stone Method for the Machine Loading Model
• The Dual Method for the Generalized Transportation Problem
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

This page was built for publication: Solution of constrained generalized transportation problems using the pivot and probe algorithm