A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
Download full text from publisher
More about this item
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-GTH-2006-11-04 (Game Theory)
- NEP-HPE-2006-11-04 (History & Philosophy of Economics)
- NEP-KNM-2006-11-04 (Knowledge Management & Knowledge Economy)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:unm:umamet:2006045. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Leonne Portz). General contact details of provider: http://edirc.repec.org/data/meteonl.html .
We have no references for this item. You can help adding them by using this form .