The max-out min-in problem: a tool for data analysis
From MaRDI portal
Publication:6164596
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Cluster Analysis
- Computational aspects of algorithms for variable selection in the context of principal components
- Data Clustering: Theory, Algorithms, and Applications
- Independent domination in graphs: A survey and recent results
- Principal component analysis.
- Principal component analysis: a review and recent developments
- Solving the maxcut problem by the global equilibrium search
- Some simplified NP-complete graph problems
- The unconstrained binary quadratic programming problem: a survey
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)