Algorithms development for financial problems
A challenging task, spanning across various industries in the modern world, is to solve complex practical problems classified as NP-hard. NP-hard stands for Non deterministic Polynomial-time hard. It represents a class of problems that are computationally intractable, implying that it is overwhelmin...
Saved in:
Main Author: | Vasudevan Prabhakaran |
---|---|
Other Authors: | Lim Meng Hiot |
Format: | Final Year Project |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/18371 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Meta-heuristic algorithms development for combinatorial optimization within an integrated problem solving environment
by: Xu, Yiliang
Published: (2008) -
Financial engineering approach for analysing property data problem
by: Chen, Zhen Liang.
Published: (2008) -
Genetic algorithm based approaches for the quadratic assignment problem
by: Yuan, Yu.
Published: (2009) -
Exploring advanced control algorithm in thermal processing problems
by: Zhang, Cheng Cheng
Published: (2010) -
A tabu search algorithm for static routing and wavelength assignment problem
by: Wang, Ying, et al.
Published: (2010)