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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/18371 |