An Out-of-Kilter Method for Minimal-Cost Flow Problems

This publication has 8 references indexed in Scilit:

• Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
  Proceedings of Symposia in Applied Mathematics, 1960
• Constructing Maximal Dynamic Flows from Static Flows
  Operations Research, 1958
• A theorem on flows in networks
  Pacific Journal of Mathematics, 1957
• Algorithms for the Assignment and Transportation Problems
  Journal of the Society for Industrial and Applied Mathematics, 1957
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
  Canadian Journal of Mathematics, 1957
• Variants of the hungarian method for assignment problems
  Naval Research Logistics Quarterly, 1956
• Maximal Flow Through a Network
  Canadian Journal of Mathematics, 1956
• The Hungarian method for the assignment problem
  Naval Research Logistics Quarterly, 1955