Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach

DOI10.1016/j.ejor.2021.06.008zbMath1490.90240OpenAlexW3167894649MaRDI QIDQ2060395

Pierre Schaus, Guillaume Derval

Publication date: 13 December 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.06.008

zbMATH Keywords

combinatorial optimizationconstraint programminglinear relaxationmaximum-sum submatrix

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (1)

Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices

Cites Work

• Unnamed Item
• Unnamed Item
• New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
• The maximum edge biclique problem is NP-complete
• The maximum weighted submatrix coverage problem: a CP approach
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
• Inapproximability of Maximum Weighted Edge Biclique and Its Applications
• Discovery Science
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach