Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(8 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-008-0246-5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: YALMIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QAPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-008-0246-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2188609405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in the solution of quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large quadratic assignment problems on computational grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Lift-and-Project Relaxations of Binary Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Crossing Numbers of Km,n and Kn / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry groups, semidefinite programs, and sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3961697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / 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: Bounds for the quadratic assignment problem using the bundle method / 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: 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
Property / DOI
 
Property / DOI: 10.1007/S10107-008-0246-5 / rank
 
Normal rank

Latest revision as of 05:08, 10 December 2024

scientific article
Language Label Description Also known as
English
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
scientific article

    Statements

    Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (English)
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers