Pages that link to "Item:Q4852576"
From MaRDI portal
The following pages link to Nonpolyhedral Relaxations of Graph-Bisection Problems (Q4852576):
Displaying 27 items.
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction (Q4638912) (← links)
- Rank Optimality for the Burer--Monteiro Factorization (Q4971016) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
