Solving the order-preserving submatrix problem via integer programming

DOI10.1287/IJOC.1090.0358MaRDI QIDQ2899070zbMATH OpenOpenAlexFDO

Authors Oleg A. Prokopyev, Andrew C. Trapp

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/eba76466791fc25ab9f8e56fe6251c3c7149c0ff

zbMATH Keywords

biclusteringdata mininginteger programmingorder-preserving submatrix

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
• Recovering all generalized order-preserving submatrices: new exact formulations and algorithms
• Mining order-preserving submatrices from probabilistic matrices
• Computing and Combinatorics
• A note on order preserving matchings

Cited in

(5)

• Recovering all generalized order-preserving submatrices: new exact formulations and algorithms
• Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach
• Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
• Mining order-preserving submatrices from probabilistic matrices
• Identifying Fixations in Gaze Data via Inner Density and Optimization

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Solving the order-preserving submatrix problem via integer programming

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