PROXIMUS

swMATH4989MaRDI QIDQ17136FDOQ17136

Author name not available (Why is that?)

Cited In (12)

• The bipartite Boolean quadric polytope
• Scalable density-based clustering with quality guarantees using random projections
• The bipartite QUBO
• Integer matrix approximation and data mining
• Markov chain methods for the bipartite Boolean quadratic programming problem
• Parameterized low-rank binary matrix approximation
• A clustering approach to constrained binary matrix factorization
• On the rank-one approximation of positive matrices using tropical optimization methods
• BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent
• CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets
• Parameterized low-rank binary matrix approximation
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases

This page was built for software: PROXIMUS