Morph-based local-search heuristics for large-scale combinatorial data analysis
From MaRDI portal
Publication:1963866
DOI10.1007/S003579900052zbMath0947.62001OpenAlexW2001050290MaRDI QIDQ1963866
Publication date: 3 February 2000
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003579900052
Recommendations
- Finding approximate solutions to combinatorial problems with very large data sets using BIRCH π π
- Structural analysis of local search heuristics in combinatorial optimization π π
- Searching combinatorial optimality using graph-based homology information π π
- A divide-and-conquer local search heuristic for data visualization π π
- An interactive multiobjective programming approach to combinatorial data analysis π π
- Note: A local-search heuristic for large set-covering problems π π
- Local search algorithms for the composite retrieval problem π π
- Unnamed Item π π
- Unnamed Item π π
- Unnamed Item π π
This page was built for publication: Morph-based local-search heuristics for large-scale combinatorial data analysis