The Power of Dominance Relations in Branch-and-Bound Algorithms

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Toshihide Ibaraki Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto, Japan
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 24 Issue 2, April 1977
Pages 264-279
ACM New York, NY, USA
table of contents doi>10.1145/322003.322010
The Power of Dominance Relations in Branch-and-Bound Algorithms Published by ACM 1977 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 29
· Downloads (cumulative): 640
· Citation Count: 22


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 © 2013 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