Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-017-9968-8 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: ADMM_QAP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QAPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2601563163 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.09339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex relaxation of graph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Quadratic Assignment Problem on a Tree / 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: A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADMM for the SDP relaxation of the QAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/15324430260185646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new relaxation framework for quadratic assignment problems based on matrix splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional isomorphism of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation 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: A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints / 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/S10589-017-9968-8 / rank
 
Normal rank

Latest revision as of 07:48, 11 December 2024

scientific article
Language Label Description Also known as
English
Semidefinite programming approach for the quadratic assignment problem with a sparse graph
scientific article

    Statements

    Semidefinite programming approach for the quadratic assignment problem with a sparse graph (English)
    0 references
    0 references
    0 references
    20 April 2018
    0 references
    graph matching
    0 references
    quadratic assignment problem
    0 references
    convex relaxation
    0 references
    semidefinite programming
    0 references
    alternating direction method of multipliers
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers