Convex Relaxations for Permutation Problems (Q3456867): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Mosek / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1949523763 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1306.4805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Algorithm for Seriation and the Consecutive Ones Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral algorithm for envelope reduction of sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating orthogonal matrices by permutation matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Value Iteration method for the Average Cost Dynamic Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\ell ^2_2\) spreading metrics for vertex ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer approximation algorithms via spreading metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the bandwidth via volume respecting embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation ratio for the minimum linear arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest compact formulation for the permutahedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abundance matrices and seriation in archaeology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seriation and matrix reordering methods: An historical overview / 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: On the consecutive ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of random symmetric matrices and quadratic optimization under orthogonality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of matrix scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Investigation of Interior-Point Algorithms for the Linear Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approximation Techniques for Some Linear Ordering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moment inequalities for sums of random matrices and their applications in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:13, 11 July 2024

scientific article
Language Label Description Also known as
English
Convex Relaxations for Permutation Problems
scientific article

    Statements

    Convex Relaxations for Permutation Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2015
    0 references
    seriation
    0 references
    C1P
    0 references
    convex relaxation
    0 references
    quadratic assignment problem
    0 references
    shotgun DNA sequencing
    0 references
    0 references
    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