Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998): 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: Q4496016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the quadratic assignment problem based on convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Bregman Projections for Regularized Transportation Problems / 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: Proximal minimization algorithm with \(D\)-functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation / 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 dual framework for lower bounds of the quadratic assignment problem based on linearization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The invisible hand algorithm: solving the assignment problem with statistical physics / 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: The Quadratic Assignment Problem / 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: Q4633862 / 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: Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised reformulation-linearization technique for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized solution of the orthogonal Procrustes problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank

Revision as of 09:45, 2 August 2024

scientific article; zbMATH DE number 7716383
Language Label Description Also known as
English
Sinkhorn Algorithm for Lifted Assignment Problems
scientific article; zbMATH DE number 7716383

    Statements

    Sinkhorn Algorithm for Lifted Assignment Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 July 2023
    0 references
    quadratic assignment
    0 references
    shape matching
    0 references
    Sinkhorn
    0 references
    convex relaxations
    0 references
    Johnson-Adams
    0 references
    Sherali-Adams
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references