Polynomial dual network simplex algorithms
By: by J. Orlin, S. Plotkin, É. Tardos.
Contributors: Plotkin, Serge A.; Tardos, Éva.
Series: Report ;; no. STAN-CS-91-1374; Report (Stanford University. Computer Science Dept.) ;; no. STAN-CS-1374.
Publisher: Dept. of Computer Science, Stanford University
Published: 1991
Place of publication: Stanford, Calif
Language: eng
Number of pages: 23
Subjects: Network analysis (Planning); Mathematical optimization.; Algorithms.
Notes: Includes bibliographical references (p. 22-23).
Cover title.
"August 1991."