Browsing Combinatorics and Optimization by Subject "eigenvalue bounds"
Now showing items 1-1 of 1
-
Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems
(University of Waterloo, 2014-09-03)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 ...