A PRIMAL METHOD FOR MINIMAL COST FLOWS WITH APPLICATIONS TO THE ASSIGNMENT AND TRANSPORTATION PROBLEMS.

Abstract

A simple procedure is given for solving minimal cost flow problems in which feasible flows are maintained throughout. It specializes to give primal algorithms for the assignment and transportation problems. Convex cost problems can also be handled. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1966
Accession Number
AD0634087

Entities

People

  • Morton Klein

Organizations

  • Columbia University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Transportation

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Economics
  • Fluid Dynamics.