Seriation using tree-penalized path length

DOI10.1016/j.ejor.2022.06.026OpenAlexW4283016427MaRDI QIDQ2098032

Craig L. Zirbel, Denis A. Aliyev

Publication date: 17 November 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.06.026

zbMATH Keywords

TSPcombinatorial optimizationlinear orderingsoptimal leaf orderingtree penalized distance

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• R
• lattice
• seriation
• latticeExtra
• FR3D
• viridis
• GAP

Cites Work

• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• FR3D: Finding local and composite recurrent structural motifs in RNA 3D structures
• The traveling salesman problem and its variations
• An experimental comparison of seriation methods for one-mode two-way data
• Combinatorial Data Analysis
• Statistical Analysis of Financial Data in S-Plus
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Seriation using tree-penalized path length