Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
From MaRDI portal
Publication:296969
DOI10.1016/j.ejor.2013.10.007zbMath1339.90203OpenAlexW2097687466MaRDI QIDQ296969
Etienne de Klerk, Marianna. E.-Nagy, Uwe Truetsch, Renata Sotirov
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.007
semidefinite programmingquadratic assignment problemreformulation-linearization techniquesherali-Adams hierarchystandard quadratic optimization
Semidefinite programming (90C22) Quadratic programming (90C20) Discrete location and assignment (90B80)
Related Items
New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, Semidefinite programming and eigenvalue bounds for the graph partition problem, Exploiting symmetry in copositive programs via semidefinite hierarchies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Spreads in strongly regular graphs
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Strengthened semidefinite programming bounds for codes
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Uniqueness and nonexistence of some graphs related to \(M_{22}\)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On semidefinite programming relaxations of maximum \(k\)-section
- A simple group of order 44,352,000
- Approximation of the Stability Number of a Graph via Copositive Programming
- SDP Relaxations for Some Combinatorial Optimization Problems
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
- Using Symmetry to Optimize Over the Sherali-Adams Relaxation
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A comparison of the Delsarte and Lovász bounds
- Bounds for binary codes of length less than 25
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A table of upper bounds for binary codes
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Semidefinite Code Bounds Based on Quadruple Distances
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
