The max-out min-in problem: a tool for data analysis

DOI10.1016/j.cor.2023.106218MaRDI QIDQ6164596

Marcos Raydan, Maria João Martins, Jorge Orestes Cerdeira

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

computational complexityquadratic programmingcombinatorial optimizationweighted graphscluster analysisvariable selection

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Quadratic programming (90C20) Combinatorial optimization (90C27) Signed and weighted graphs (05C22) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Computational aspects of algorithms for variable selection in the context of principal components
• The unconstrained binary quadratic programming problem: a survey
• Solving the maxcut problem by the global equilibrium search
• Some simplified NP-complete graph problems
• Principal component analysis.
• Independent domination in graphs: A survey and recent results
• Principal component analysis: a review and recent developments
• Cluster Analysis
• Data Clustering: Theory, Algorithms, and Applications

This page was built for publication: The max-out min-in problem: a tool for data analysis