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

DOI10.1016/J.COR.2023.106218MaRDI QIDQ6164596FDOQ6164596

Authors: Jorge Orestes Cerdeira, M. J. Martins, M. Raydan 

Publication date: 4 July 2023

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

Recommendations

• The maximum cut problem
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• On graphs of the cone decompositions for the min-cut and max-cut problems
• The maximum box problem and its application to data analysis
• Combinatorial and geometric properties of the max-cut and min-cut problems

zbMATH Keywords

variable selectioncluster analysiscomputational complexityquadratic programmingcombinatorial optimizationweighted graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Classification and regression in prescriptive analytics: development of hybrid models and an example of ship inspection by port state control

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

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