SIGN IN
SIGN UP
Minit algorithm for linear programming
Full Text:
PDF
Buy this Article
Authors:
Å. Kolm
Information Processing Department, ASEA, Västerås, Sweden
T. Dahlstrand
Information Processing Department, ASEA, Västerås, Sweden
Published in:
· Magazine
Communications of the ACM
CACM Homepage
archive
Volume 14 Issue 1, Jan. 1971
Page 50
ACM
New York, NY
, USA
table of contents
doi>
10.1145/362452.362510
1971 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 7
· Downloads (cumulative): 126
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
dual problem
dual simplex method
linear programming
primal problem
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder