Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A level-2 reformulation-linearization technique bound for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A table of upper bounds for binary codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for binary codes of length less than 25 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness and nonexistence of some graphs related to \(M_{22}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite programming relaxations of maximum \(k\)-section / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Code Bounds Based on Quadruple Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite bounds for the stability number of a graph via sums of squares of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spreads in strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple group of order 44,352,000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthened semidefinite programming bounds for codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Symmetry to Optimize Over the Sherali-Adams Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing RLT relaxations via a new class of semidefinite cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP Relaxations for Some Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4758117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank

Latest revision as of 05:15, 12 July 2024

scientific article
Language Label Description Also known as
English
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
scientific article

    Statements

    Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2016
    0 references
    reformulation-linearization technique
    0 references
    sherali-Adams hierarchy
    0 references
    quadratic assignment problem
    0 references
    standard quadratic optimization
    0 references
    semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers