Solving large-scale combinatorial optimization problems
I use the positive semidefinite relaxation to approximate combinatorial and quadratic optimization problems subject to linear and boolean constraints. I present a dual potential reduction algorithm and show how it exploits structure and sparsity. Coupled with randomized and heuristic methods, I repo...
Uložené v:
| Hlavný autor: | |
|---|---|
| Médium: | Dissertation |
| Jazyk: | English |
| Vydavateľské údaje: |
ProQuest Dissertations & Theses
01.01.1998
|
| Predmet: | |
| ISBN: | 0599022574, 9780599022577 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | I use the positive semidefinite relaxation to approximate combinatorial and quadratic optimization problems subject to linear and boolean constraints. I present a dual potential reduction algorithm and show how it exploits structure and sparsity. Coupled with randomized and heuristic methods, I report computational results for approximating combinatorial problems with dimension up to 7000. |
|---|---|
| Bibliografia: | SourceType-Dissertations & Theses-1 ObjectType-Dissertation/Thesis-1 content type line 12 |
| ISBN: | 0599022574 9780599022577 |