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

DOI10.1007/S003579900052MaRDI QIDQ1963866zbMATH OpenOpenAlexFDO

Authors 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

• Structural analysis of local search heuristics in combinatorial optimization
• Local search heuristics for combinatorial optimization problems
• Searching combinatorial optimality using graph-based homology information
• Finding approximate solutions to combinatorial problems with very large data sets using BIRCH
• A divide-and-conquer local search heuristic for data visualization
• Note: A local-search heuristic for large set-covering problems
• scientific article; zbMATH DE number 1163099
• An interactive multiobjective programming approach to combinatorial data analysis
• Local search algorithms for the composite retrieval problem
• scientific article; zbMATH DE number 1054933

Cited in

(3)

• A divide-and-conquer local search heuristic for data visualization
• The orbiter ecosystem for combinatorial data
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis

This page was built for publication: Morph-based local-search heuristics for large-scale combinatorial data analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963866)