Pages that link to "Item:Q1785334"
From MaRDI portal
The following pages link to The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334):
Displaying 11 items.
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics (Q1713404) (← links)
- An experimental comparison of seriation methods for one-mode two-way data (Q1752777) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- Reconstruction of line-embeddings of graphons (Q2136610) (← links)
- Robinsonian matrices: recognition challenges (Q2403299) (← links)
- Convex Relaxations for Permutation Problems (Q3456867) (← links)
- A New Tractable Case of the QAP with a Robinson Matrix (Q5743542) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
- An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)