Morph-based local-search heuristics for large-scale combinatorial data analysis

DOI10.1007/S003579900052zbMath0947.62001OpenAlexW2001050290MaRDI QIDQ1963866

Michael J. Brusco

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

zbMATH Keywords

seriationunidimensional scalingcombinatorial data analysislocal-search

Mathematics Subject Classification ID

One- and multidimensional scaling in the social and behavioral sciences (91C15)

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