Contribution of copositive formulations to the graph partitioning problem
From MaRDI portal
Publication:4916308
DOI10.1080/02331934.2011.560385zbMath1291.90166OpenAlexW1982105134MaRDI QIDQ4916308
Publication date: 22 April 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.560385
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Integer programming (90C10) Combinatorial optimization (90C27)
Related Items (2)
BiqBin: Moving Boundaries for NP-hard Problems by HPC ⋮ On sufficient properties of sufficient matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Quadratic factorization heuristics for copositive programming
- Semidefinite approximations for quadratic programs over orthogonal matrices
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- Semidefinite programming relaxations for the quadratic assignment problem
- Graph partitioning using linear and semidefinite programming
- Semidefinite programming relaxations for the graph partitioning problem
- Approximation algorithms for minimum \(K\)-cut
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the Stability Number of a Graph via Copositive Programming
- Recent directions in netlist partitioning: a survey
- Some NP-complete problems in quadratic and nonlinear programming
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- A Copositive Programming Approach to Graph Partitioning
- Lower Bounds for the Partitioning of Graphs
This page was built for publication: Contribution of copositive formulations to the graph partitioning problem
