Continuation methods for approximate large scale object sequencing
From MaRDI portal
Recommendations
- Convex relaxations for permutation problems
- An experimental comparison of seriation methods for one-mode two-way data
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- Seriation in combinatorial and statistical data analysis
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
Cites work
- scientific article; zbMATH DE number 6118218 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- A Spectral Algorithm for Seriation and the Consecutive Ones Problem
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- A spectral algorithm for envelope reduction of sparse matrices
- A spectral approach to bandwidth and separator problems in graphs
- A survey for the quadratic assignment problem
- Abundance matrices and seriation in archaeology
- An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- An efficient continuation method for quadratic assignment problems
- An experimental comparison of seriation methods for one-mode two-way data
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices
- Continuation methods for approximate large scale object sequencing
- Convex optimization: algorithms and complexity
- Convex relaxations for permutation problems
- Incidence matrices and interval graphs
- Laplace eigenvalues and bandwidth‐type invariants of graphs
- Metric methods for analyzing partially ranked data
- Multiple View Geometry in Computer Vision
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- Optimal linear labelings and eigenvalues of graphs
- Recent advances in the solution of quadratic assignment problems
- Seriation and matrix reordering methods: An historical overview
- Smallest compact formulation for the permutahedron
- The University of Florida sparse matrix collection
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- The quadratic assignment problem. Theory and algorithms
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
Cited in
(7)- Seriation using tree-penalized path length
- Approximate sequencing for variable length tasks.
- An experimental comparison of seriation methods for one-mode two-way data
- Convex relaxations for permutation problems
- An Optimal Algorithm for Strict Circular Seriation
- The seriation problem in the presence of a double Fiedler value
- Continuation methods for approximate large scale object sequencing
This page was built for publication: Continuation methods for approximate large scale object sequencing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669313)
