A faster strongly polynomial minimum cost flow algorithm

Includes bibliographical references.

Bibliographic Details
Other Authors: Orlin, James B., 1953-.
Language:eng
Published: Alfred P. Sloan School of Management, Massachusetts Institute of Technology 2003
Subjects:
Online Access:http://hdl.handle.net/1721.1/2265
_version_ 1811079763664568320
author2 Orlin, James B., 1953-.
author_facet Orlin, James B., 1953-.
collection MIT
description Includes bibliographical references.
first_indexed 2024-09-23T11:20:05Z
id mit-1721.1/2265
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T11:20:05Z
publishDate 2003
publisher Alfred P. Sloan School of Management, Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/22652019-04-12T08:21:14Z A faster strongly polynomial minimum cost flow algorithm Orlin, James B., 1953-. Sloan School of Management. HD28 .M414 no.3060-, 89 Includes bibliographical references. Supported in part by the Presidential Young Investigator Grant of the National Science Foundation. 8451517-ECS Supported in part by the Air Force Office of Scientific Research. AFOSR-88-0088 Supported in part by grants from Analog Devices, Apple Computers, Inc. and Prime Computer. James B. Orlin. 2003-04-29T05:02:29Z 2003-04-29T05:02:29Z 1989 no. 3060-89-MS http://hdl.handle.net/1721.1/2265 eng Working paper (Sloan School of Management) ; 3060-89. 34 p. 2314839 bytes application/pdf application/pdf Alfred P. Sloan School of Management, Massachusetts Institute of Technology
spellingShingle HD28 .M414 no.3060-, 89
A faster strongly polynomial minimum cost flow algorithm
title A faster strongly polynomial minimum cost flow algorithm
title_full A faster strongly polynomial minimum cost flow algorithm
title_fullStr A faster strongly polynomial minimum cost flow algorithm
title_full_unstemmed A faster strongly polynomial minimum cost flow algorithm
title_short A faster strongly polynomial minimum cost flow algorithm
title_sort faster strongly polynomial minimum cost flow algorithm
topic HD28 .M414 no.3060-, 89
url http://hdl.handle.net/1721.1/2265