Improved metaheuristics for the quartet method of hierarchical clustering
DOI10.1007/s10898-019-00871-1zbMath1465.90085OpenAlexW2999532546WikidataQ126379427 ScholiaQ126379427MaRDI QIDQ2022207
Gijs Geleijnse, Sergio Consoli, Steffen Pauws, Jan H. M. Korst
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00871-1
combinatorial optimizationmetaheuristicshierarchical clusteringgraphsdata miningNP-hardnessquartet treesminimum quartet tree cost
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Optimization by Simulated Annealing
- A fast quartet tree heuristic for hierarchical clustering
- The generation of random, binary unordered trees
- The complexity of reconstructing trees from qualitative characters and subtrees
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- Future paths for integer programming and links to artificial intelligence
- Variable neighborhood decomposition search
- An exact algorithm for the minimum quartet tree cost problem
- Integer linear programming as a tool for constructing trees from quartet data
- A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Search Methodologies
- Clustering by Compression
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
- A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Improved metaheuristics for the quartet method of hierarchical clustering
