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:
Main Author: | |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://eprints.usm.my/46600/1/Choong_Shin_Siang_PhD_Thesis24.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|