Stanislav Busygin

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
An improved heuristic for consistent biclustering problems Applied Optimization	2018-03-12	Paper
Finding checkerboard patterns via fractional 0-1 programming Journal of Combinatorial Optimization	2010-11-12	Paper
Biclustering in data mining Computers & Operations Research	2008-03-11	Paper
An optimization-based approach for data classification Optimization Methods & Software	2007-09-03	Paper
A new trust region technique for the maximum weight clique problem Discrete Applied Mathematics	2006-10-30	Paper
Continuous approaches for solving discrete optimization problems	2006-10-17	Paper
On NP-hardness of the clique partition -- independence number gap recognition and related problems Discrete Mathematics	2006-04-28	Paper
Feature selection for consistent biclustering via fractional 0-1 programming Journal of Combinatorial Optimization	2005-12-13	Paper
A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere Journal of Combinatorial Optimization	2002-08-20	Paper

Research outcomes over time

This page was built for person: Stanislav Busygin