Finding checkerboard patterns via fractional 0-1 programming

DOI10.1007/s10878-008-9186-5zbMath1198.90292OpenAlexW2022669521MaRDI QIDQ604870

Oleg A. Prokopyev, Stanislav Busygin, Andrew C. Trapp

Publication date: 12 November 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9186-5

zbMATH Keywords

heuristicsdata miningfractional 0-1 programmingunsupervised biclustering

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Fractional programming (90C32) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items (4)

Fractional 0-1 programming: applications and algorithms ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ Identifying Fixations in Gaze Data via Inner Density and Optimization ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations

Cites Work

• Hyperbolic 0-1 programming and query optimization in information retrieval
• A note on a global approach for general 0-1 fractional programming
• On complexity of unconstrained hyperbolic 0--1 programming problems
• Global optimization of 0-1 hyperbolic programs
• Biclustering in data mining
• Feature selection for consistent biclustering via fractional 0-1 programming
• Solving a (0, 1) hyperbolic program by branch and bound
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding checkerboard patterns via fractional 0-1 programming