Transportation problems which can be solved by the use of hirsch-paths for the dual problems

This publication has 11 references indexed in Scilit:

• The d-Step Conjecture and Its Relatives
  Mathematics of Operations Research, 1987
• A competitive (dual) simplex method for the assignment problem
  Mathematical Programming, 1986
• Efficient dual simplex algorithms for the assignment problem
  Mathematical Programming, 1985
• Signature Methods for the Assignment Problem
  Operations Research, 1985
• The Hirsch Conjecture for Dual Transportation Polyhedra
  Mathematics of Operations Research, 1984
• Solving the Assignment Problem by Relaxation
  Operations Research, 1980
• On two special classes of transportation polytopes
  1974
• The d-step conjecture for polyhedra of dimension d<6
  Acta Mathematica, 1967
• Research Problems
  Bulletin of the American Mathematical Society, 1964
• Algorithm 27: assignment
  Communications of the ACM, 1960