Nonpolyhedral Relaxations of Graph-Bisection Problems
From MaRDI portal
Publication:4852576
DOI10.1137/0805024zbMath0838.90130OpenAlexW2085595139MaRDI QIDQ4852576
Publication date: 1 November 1995
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/aeb498e247313d45cc70a5c43e9af9c7c130bdad
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Semi-infinite programming (90C34)
Related Items
The Boolean Quadric Polytope, Mathematical Programming Models and Exact Algorithms, Using the eigenvalue relaxation for binary least-squares estimation problems, Applications of cut polyhedra. II, On a positive semidefinite relaxation of the cut polytope, Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations, Solving the max-cut problem using eigenvalues, A projection technique for partitioning the nodes of a graph, Semidefinite programming in combinatorial optimization, LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison, On semidefinite programming relaxations of maximum \(k\)-section, A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem, Gap inequalities for non-convex mixed-integer quadratic programs, New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, Spectral methods for graph bisection problems., Cardinality constrained minimum cut problems: complexity and algorithms., A guide to conic optimisation and its applications, The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction, The real positive semidefinite completion problem for series-parallel graphs, Semidefinite programming and combinatorial optimization, Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems, Rank Optimality for the Burer--Monteiro Factorization, Spectral bounds for the maximum cut problem, Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Heuristics for semirandom graph problems, Node and edge relaxations of the max-cut problem
