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 primal network simplex algorithm for minimum cost flows

A polynomial time primal network simplex algorithm for minimum cost flows

Thumbnail Image
Download
Name

SWP-3834-33338649.pdf

Size

1.92 MB

Format

Adobe PDF

Checksum (MD5)

02ba842ac584bf91add7773728dcc0a2

Date Issued
1995
Publisher
Sloan School of Management, Massachusetts Institute of Technology]
Series/Report no.
Working paper (Sloan School of Management) ; 3834-95.
Description
Cover title.
Includes bibliographical references (p. 25-27).
Persistent DSpace Link
http://hdl.handle.net/1721.1/2584
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.