A faster strongly polynomial minimum cost flow algorithm
Abstract
No abstract is available for this item.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.Bibliographic Info
Paper provided by Massachusetts Institute of Technology (MIT), Sloan School of Management in its series Working papers with number 3060-89..Length:
Date of creation: 1989
Date of revision:
Handle: RePEc:mit:sloanp:2265
Contact details of provider:
Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA
Phone: 617-253-2659
Web page: http://mitsloan.mit.edu/
More information through EDIRC
Order Information:
Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA
Related research
Keywords: HD28 .M414 no.3060-; 89;Find related papers by JEL classification:
References
References listed on IDEASPlease report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Morton Klein, 1967. "A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems," Management Science, INFORMS, vol. 14(3), pages 205-220, November.
- Orlin, James B., 1953-., 1988. "A faster strongly polynomial minimum cost flow algorithm," Working papers 2042-88., Massachusetts Institute of Technology (MIT), Sloan School of Management.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:2265For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

