scientific article; zbMATH DE number 1182569
From MaRDI portal
Publication:4400639
zbMATH Open0905.90171MaRDI QIDQ4400639FDOQ4400639
Authors: Stefan E. Karisch, Franz Rendl 
Publication date: 2 August 1998
Title of this publication is not available (Why is that?)
Recommendations
- Graph partitioning using linear and semidefinite programming
- An efficient semidefinite programming relaxation for the graph partition problem
- Semidefinite programming relaxations for the graph partitioning problem
- scientific article; zbMATH DE number 2088028
- Semidefinite programming and eigenvalue bounds for the graph partition problem
Cited In (44)
- Title not available (Why is that?)
- Engineering branch-and-cut algorithms for the equicut problem
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Graph partitioning using linear and semidefinite programming
- On the Slater condition for the SDP relaxations of nonconvex sets
- Graph Partitioning and Continuous Quadratic Programming
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
- Title not available (Why is that?)
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite spectral clustering
- Semidefinite programming relaxations for the graph partitioning problem
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
- Polyhedral approximations of the semidefinite cone and their application
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph
- SDP-based bounds for graph partition via extended ADMM
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- Facial reduction algorithms for conic optimization problems
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
- Matrix relaxations in combinatorial optimization
- Realignment in the National Football League: Did they do it right?
- Semidefinite approximations for quadratic programs over orthogonal matrices
- Graph-Based Representations in Pattern Recognition
- Semidefinite programming and combinatorial optimization
- Robust optimization of graph partitioning involving interval uncertainty
- Title not available (Why is that?)
- A potential reduction approach to the frequency assignment problem
- Contribution of copositive formulations to the graph partitioning problem
- Graph separation techniques for quadratic zero-one programming
- SDP relaxations for some combinatorial optimization problems
- On semidefinite programming relaxations of maximum \(k\)-section
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- An efficient semidefinite programming relaxation for the graph partition problem
- A Copositive Programming Approach to Graph Partitioning
- Title not available (Why is that?)
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Linear and quadratic programming approaches for the general graph partitioning problem
- Solving graph equipartition SDPs on an algebraic variety
- Contribution of copositive formulations to graph partitioning problem
- Partitioning through projections: strong SDP bounds for large graph partition problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400639)
