scientific article; zbMATH DE number 1182569
From MaRDI portal
Publication:4400639
zbMath0905.90171MaRDI QIDQ4400639
Franz Rendl, Stefan E. Karisch
Publication date: 2 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Matrix Relaxations in Combinatorial Optimization, Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems, Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations, Facial reduction algorithms for conic optimization problems, The Maximum k-Colorable Subgraph Problem and Related Problems, A potential reduction approach to the frequency assignment problem, On semidefinite programming relaxations of maximum \(k\)-section, Semidefinite approximations for quadratic programs over orthogonal matrices, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, Partitioning through projections: strong SDP bounds for large graph partition problems, New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, Solving graph equipartition SDPs on an algebraic variety, Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs, An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem, Robust optimization of graph partitioning involving interval uncertainty, Linear and quadratic programming approaches for the general graph partitioning problem, Contribution of copositive formulations to the graph partitioning problem, Semidefinite programming and combinatorial optimization, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Polyhedral approximations of the semidefinite cone and their application, Semidefinite relaxations for partitioning, assignment and ordering problems, SDP Relaxations for Some Combinatorial Optimization Problems, Semidefinite relaxations for partitioning, assignment and ordering problems, Realignment in the National Football League: Did they do it right?, Engineering Branch-and-Cut Algorithms for the Equicut Problem, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Semidefinite programming and eigenvalue bounds for the graph partition problem, On the Slater condition for the SDP relaxations of nonconvex sets
