A polynomial-time parametric simplex algorithm for the minimum cost network flow problem

Orlin, James B., 1953-.

No 1484-83., Working papers from Massachusetts Institute of Technology (MIT), Sloan School of Management

Keywords: HD28 .M414 no.1484-; 83; Simplexes (Mathematics); Algorithms (search for similar items in EconPapers)
Date: 1983
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/1721.1/2058 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:mit:sloanp:2058

Ordering information: This working paper can be ordered from
MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA

Access Statistics for this paper

More papers in Working papers from Massachusetts Institute of Technology (MIT), Sloan School of Management MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA. Contact information at EDIRC.
Bibliographic data for series maintained by None ( this e-mail address is bad, please contact ).