Comparing two models to generate hyper-heuristics for the 2d-regular bin-packing problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: H. Terashima-Marin ITESM-Intelligent Systems, Monterrey, NL, Mexico
C. J. Farias Zarate ITESM-Intelligent Systems, Monterrey, NL, Mexico
P. Ross Napier University, Edinburgh, UK
M. Valenzuela-Rendon ITESM-Intelligent Systems, Monterrey, NL, Mexico
Comparing two models to generate hyper-heuristics for the 2d-regular bin-packing problem Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 21
· Downloads (cumulative): 239
· Citation Count: 4

Published in:
· Proceeding
GECCO '07 Proceedings of the 9th annual conference on Genetic and evolutionary computation
Pages 2182-2189
ACM New York, NY, USA ©2007
table of contents ISBN: 978-1-59593-697-4 doi>10.1145/1276958.1277377

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