Combinatorial and algebraic algorithms in set covering and partitioning problems
In this dissertation, we focus on using combinatorial and algebraic methods on two classes of NP-hard problems, the set covering problem and the set partitioning problem. The inputs to both problems are a universe of elements U, and a collection S of subsets of U. NP-hard problems are generally beli...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertation |
| Language: | English |
| Published: |
ProQuest Dissertations & Theses
01.01.2014
|
| Subjects: | |
| ISBN: | 1321403321, 9781321403329 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!