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...
| Autor principal: | |
|---|---|
| Formato: | Tesis |
| Lenguaje: | English |
| Publicado: |
2019
|
| Materias: | |
| Acceso en línea: | http://eprints.usm.my/46600/1/Choong_Shin_Siang_PhD_Thesis24.pdf |