On the worst case complexity of potential reduction algorithms for linear programming
DownloadOR-279-93-28226978.pdf (1.423Mb)
Metadata
Show full item recordDescription
Includes bibliographical references (p. 16-17).
Date issued
1993Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 279-93