Relaxations of Combinatorial Problems Via Association Schemes
From MaRDI portal
Publication:2802525
DOI10.1007/978-1-4614-0769-0_7zbMath1334.90100OpenAlexW2158270219WikidataQ56874365 ScholiaQ56874365MaRDI QIDQ2802525
Etienne de Klerk, Fernando M. de Oliveira Filho, Dimitrii V. Pasechnik
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_7
Related Items
Symmetry in Turán sums of squares polynomials from flag algebras, On semidefinite programming bounds for graph bandwidth, Graph bisection revisited, Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps, The independence number for polarity graphs of even order planes, The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem, Minimum energy configurations on a toric lattice as a quadratic assignment problem, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, On Integrality in Semidefinite Programming for Discrete Optimization, An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem, Gaddum's test for symmetric cones, Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem, Semidefinite programming and eigenvalue bounds for the graph partition problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Minimum-weight cycle covers and their approximability
- Commutative association schemes
- Multilinear algebra. 2nd ed
- Semidefinite programming relaxations for the quadratic assignment problem
- An improved rounding method and semidefinite programming relaxation for graph partition
- Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- A comparison of the Delsarte and Lovász bounds
- On the Shannon capacity of a graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A General Approximation Technique for Constrained Forest Problems
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- A GAP Package for Computation with Coherent Configurations
- A .699-approximation algorithm for Max-Bisection.
