Pages that link to "Item:Q3456867"
From MaRDI portal
The following pages link to Convex Relaxations for Permutation Problems (Q3456867):
Displaying 14 items.
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- \texttt{PQser:} a Matlab package for spectral seriation (Q670489) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- The unit-capacity constrained permutation problem (Q1754340) (← links)
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334) (← links)
- Permutatorial optimization via the permutahedron (Q2083997) (← links)
- Reconstruction of line-embeddings of graphons (Q2136610) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
- ADM-CLE Approach for Detecting Slow Variables in Continuous Time Markov Chains and Dynamic Data (Q2964446) (← links)
- Permutation Problems and Channelling Constraints (Q2996177) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)
- Localization in 1D non-parametric latent space models from pairwise affinities (Q6170608) (← links)
