Relaxations of combinatorial problems via association schemes
From MaRDI portal
(Redirected from Publication:2802525)
Recommendations
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3634289 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 1304324 (Why is no real title available?)
- scientific article; zbMATH DE number 1342125 (Why is no real title available?)
- A .699-approximation algorithm for Max-Bisection.
- A GAP Package for Computation with Coherent Configurations
- A General Approximation Technique for Constrained Forest Problems
- A comparison of the Delsarte and Lovász bounds
- An improved rounding method and semidefinite programming relaxation for graph partition
- Approximation algorithms for maximization problems arising in graph partitioning
- Commutative association schemes
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Minimum-weight cycle covers and their approximability
- Multilinear algebra. 2nd ed
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- On the Shannon capacity of a graph
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Semidefinite programming and integer programming
- Semidefinite programming relaxations for the quadratic assignment problem
Cited in
(17)- On Integrality in Semidefinite Programming for Discrete Optimization
- Graph bisection revisited
- Optimization and highly informative graph invariants
- Semidefinite programs and association schemes
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- The unbounded integrality gap of a semidefinite relaxation of the traveling salesman problem
- Gaddum's test for symmetric cones
- Matrix relaxations in combinatorial optimization
- Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem
- Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
- On semidefinite programming bounds for graph bandwidth
- SDP relaxations for some combinatorial optimization problems
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- The independence number for polarity graphs of even order planes
- An efficient semidefinite programming relaxation for the graph partition problem
- Symmetry in Turán sums of squares polynomials from flag algebras
- Semidefinite programming and eigenvalue bounds for the graph partition problem
This page was built for publication: Relaxations of combinatorial problems via association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802525)
