Back to search

University of Waterloo

Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems

Abstract

dc:description.abstract

The Graph Partitioning problems are hard combinatorial optimization problems. We are interested in both lower bounds and upper bounds. We introduce several methods including basic eigenvalue and projected eigenvalue techniques, convex quadratic programming techniques, and semidefinite programming (SDP). In particular, we show that the SDP relaxation is equivalent to and arises from the Lagrangian relaxation for a particular quadratically constrained quadratic model. Moreover, the bounds obtained by the eigenvalue techniques are good and cheap.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2014

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wang, Ningchuan

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/8760

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Wang, Ningchuan. Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems. University of Waterloo, 2014. http://hdl.handle.net/10012/8760