Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/171962
DC Field | Value | |
---|---|---|
dc.title | AN IMPLICIT ENUMERATIVE OPTIMIZATION TECHNIQUE : BRANCH-AND-BOUND METHOD | |
dc.contributor.author | LIM TENG KUI | |
dc.date.accessioned | 2020-08-05T09:59:18Z | |
dc.date.available | 2020-08-05T09:59:18Z | |
dc.date.issued | 1975 | |
dc.identifier.citation | LIM TENG KUI (1975). AN IMPLICIT ENUMERATIVE OPTIMIZATION TECHNIQUE : BRANCH-AND-BOUND METHOD. ScholarBank@NUS Repository. | |
dc.identifier.uri | https://scholarbank.nus.edu.sg/handle/10635/171962 | |
dc.source | CCK BATCHLOAD 20200814 | |
dc.type | Thesis | |
dc.contributor.department | MATHEMATICS | |
dc.contributor.supervisor | CHEW KIM LIN | |
dc.description.degree | Bachelor's | |
dc.description.degreeconferred | BACHELOR OF SCIENCE (HONOURS) | |
Appears in Collections: | Bachelor's Theses |
Show simple item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
b19384440.pdf | 1.68 MB | Adobe PDF | RESTRICTED | None | Log In |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.