Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem

Name

genuinelypolynom00orli.pdf

Size

1.73 MB

Format

Adobe PDF

Checksum (MD5)

c4650c293791833939d8f1d35acc69df

Author(s)

Orlin, James B.

Date Issued

1984]

Publisher

Cambridge, Mass. : Massachusetts Institute of Technology

Series/Report no.

Working paper (Sloan School of Management) ; 1615-84.

Description

"December 1984."

Subjects

Network analysis.

Algorithms.

Persistent DSpace Link