dc.contributor.authorYuan, Yu.en_US
dc.date.accessioned2009-12-14T06:19:46Z
dc.date.available2009-12-14T06:19:46Z
dc.date.copyright1998en_US
dc.date.issued1998
dc.identifier.urihttp://hdl.handle.net/10356/19648
dc.description.abstractThe quadratic assignment problem (QAP)belongs to the class of NP-hard combinatorial optimization problems. In this thesis, we describe several approaches based on genetic algorithms (GA)for the QAP.en_US
dc.format.extent111 p.
dc.language.isoen
dc.rightsNANYANG TECHNOLOGICAL UNIVERSITYen_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
dc.titleGenetic algorithm based approaches for the quadratic assignment problemen_US
dc.typeThesisen_US
dc.contributor.supervisorLim, Meng Hiot.en_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.description.degreeMASTER OF ENGINEERING (EEE)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record