Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Sloan School of Management
  3. Sloan Working Papers
  4. A polynomial-time parametric simplex algorithm for the minimum cost network flow problem

A polynomial-time parametric simplex algorithm for the minimum cost network flow problem

Thumbnail Image
Download
Name

SWP-1484-15467654.pdf

Size

839.9 KB

Format

Adobe PDF

Checksum (MD5)

ad099dadaa39509138f9f6e7866343a4

Date Issued
1983
Publisher
Massachusetts Institute of Technology
Series/Report no.
Working paper (Sloan School of Management) ; 1484-83.
Description
"September 1983."
Bibliography: p. [15]
Persistent DSpace Link
http://hdl.handle.net/1721.1/2058
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.