Return to search

A faster strongly polynomial minimum cost flow algorithm

by James B. Orlin. / Also issued as: Working Paper (Sloan School of Management) ; WP 2042-88 / Includes bibliographical references (leaf 11). / Supported by a National Science Foundation Presidential Young Investigator Grant. 8451517-ECS Supported by the Air Force Office of Scientific Research, Analog Devices, Apple Computer, and Prime Computer.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/5073
Date January 1988
ContributorsOrlin, James B., 1953-, Massachusetts Institute of Technology. Operations Research Center
PublisherMassachusetts Institute of Technology, Operations Research Center
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
Format11 leaves, 1368245 bytes, application/pdf
RelationWorking paper (Massachusetts Institute of Technology. Operations Research Center) ; OR 175-88. Working paper (Sloan School of Management) ; 2042-88.

Page generated in 0.002 seconds