Design Of Perturbative Hyper-Heuristics For Combinatorial Optimisation
Combinatorial optimisation is an area which seeks to identify optimal solution(s) from a discrete solution search space. Approaches for solving combinatorial optimisation problems can be separated into two main sub-classes, i.e. exact and approximation algorithms. Exact algorithm is a sub-class of t...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2019
|
| 主题: | |
| 在线阅读: | http://eprints.usm.my/46600/1/Choong_Shin_Siang_PhD_Thesis24.pdf http://eprints.usm.my/46600/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|