Name
Title | ||
|---|---|---|
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem |
Abstract | ||
|---|---|---|
We consider the problem of partitioning the node set of a graph into k sets of given sizes in order to minimize the cut obtained using (removing) the kth set. If the resulting cut has value 0, then we have obtained a vertex separator. This problem is closely related to the graph partitioning problem. In fact, the model we use is the same as that for the graph partitioning problem except for a different quadratic objective function. We look at known and new bounds obtained from various relaxations for this NP-hard problem. This includes: the standard eigenvalue bound, projected eigenvalue bounds using both the adjacency matrix and the Laplacian, quadratic programming (QP) bounds based on recent successful QP bounds for the quadratic assignment problems, and semidefinite programming bounds. We include numerical tests for large and huge problems that illustrate the efficiency of the bounds in terms of strength and time. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10589-015-9779-8 | Computational Optimization and Applications |
Keywords | Field | DocType |
Vertex separators,Eigenvalue bounds,Semidefinite programming bounds,Graph partitioning,Large scale,05C70,15A42,90C22,90C27,90C59 | Adjacency matrix,Discrete mathematics,Mathematical optimization,Combinatorics,Quadratically constrained quadratic program,Vertex separator,Quadratic programming,Graph partition,Eigenvalues and eigenvectors,Mathematics,Semidefinite programming,Maximum cut | Journal |
Volume | Issue | ISSN |
63 | 2 | 0926-6003 |
Citations | PageRank | References |
1 | 0.35 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ting Kei Pong | 1 | 427 | 23.18 |
| hao sun | 2 | 1 | 0.35 |
| ningchuan wang | 3 | 1 | 0.35 |
| Henry Wolkowicz | 4 | 1444 | 260.72 |