Nonpolyhedral Relaxations of Graph-Bisection Problems
From MaRDI portal
Publication:4852576
Recommendations
Cited in
(31)- scientific article; zbMATH DE number 1817784 (Why is no real title available?)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- Spectral bounds for the maximum cut problem
- Gap inequalities for non-convex mixed-integer quadratic programs
- Mathematical programming models and exact algorithms
- Using the eigenvalue relaxation for binary least-squares estimation problems
- Spectral methods for graph bisection problems.
- Solving the max-cut problem using eigenvalues
- A projection technique for partitioning the nodes of a graph
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Heuristics for semirandom graph problems
- A guide to conic optimisation and its applications
- New bounds for the -k-cut and chromatic number of a graph
- Semidefinite programming in combinatorial optimization
- scientific article; zbMATH DE number 5237020 (Why is no real title available?)
- Applications of cut polyhedra. II
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Semidefinite programming and combinatorial optimization
- The real positive semidefinite completion problem for series-parallel graphs
- Rank optimality for the Burer-Monteiro factorization
- Node and edge relaxations of the max-cut problem
- On semidefinite programming relaxations of maximum \(k\)-section
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- On the Graph Bisection Cut Polytope
- On the facets of the lift-and-project relaxations of graph subdivisions
- The solution of Euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- On a positive semidefinite relaxation of the cut polytope
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- The Boolean quadric polytope
This page was built for publication: Nonpolyhedral Relaxations of Graph-Bisection Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852576)
