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


In this paper we use a specialized version of our pivot and probe algorithm to solve generalized transportation problems with side constraints. The dual of an m x n generalized transportation problem with t side constraints is a linear program with m + n + t variables and up to m x n constraints. We solve the dual problem using the probe operation to select… (More)
DOI: 10.1016/0305-0548(86)90059-6

7 Figures and Tables


  • Presentations referencing similar topics