SIGN IN
SIGN UP
Set Covering by an All Integer Algorithm: Computational Experience
Full Text:
PDF
Buy this Article
Authors:
Ronald D. Koncal
Case Western Reserve University, Department of Operations Research, Cleveland, Ohio
Harvey M. Salkin
Case Western Reserve University, Department of Operations Research, Cleveland, Ohio
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 20 Issue 2, April 1973
Pages 189-193
ACM
New York, NY
, USA
table of contents
doi>
10.1145/321752.321753
1973 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 14
· Downloads (cumulative): 484
· Citation Count: 5
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
integer programming
linear programming
measurement
performance
theory
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