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...
| Auteur principal: | |
|---|---|
| Format: | Thèse |
| Langue: | anglais |
| Publié: |
2019
|
| Sujets: | |
| Accès en ligne: | http://eprints.usm.my/46600/ |