Resource type
Thesis type
(Thesis) M.Sc.
Date created
2011-12-06
Authors/Contributors
Author: Taghipour, Sara
Abstract
We introduce the Quadratic Balanced Optimization Problem (QBOP) and study its complexity. QBOP is NP-hard even for very special cases such as Quadratic Balanced Knapsack Problem (QBKP) and Quadratic Balanced Assignment Problem (QBAP). Several general purpose algorithms are proposed and tested on the special cases of QBKP and QBAP. Polynomial solvable special cases are also identified.
Document
Identifier
etd6926
Copyright statement
Copyright is held by the author.
Scholarly level
Supervisor or Senior Supervisor
Thesis advisor: Punnen, Abraham
Member of collection
| Download file | Size |
|---|---|
| etd6926_STaghipour.pdf | 872.62 KB |