ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

A comparison of the primal-simplex and primal-dual algorithms for linear programming

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: R. K. Mueller Washington Univ., St. Louis, MO
L. Cooper Washington Univ., St. Louis, MO
Published in:
Cover Image
 
· Magazine
Communications of the ACM CACM Homepage archive
Volume 8 Issue 11, Nov. 1965
ACM New York, NY, USA
table of contents doi>10.1145/365660.365682
A comparison of the primal-simplex and primal-dual algorithms for linear programming Published by ACM 1965 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 12
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder