Exact and heuristic algorithms for the maximum weighted submatrix coverage problem

DOI10.1016/j.ejor.2021.07.035zbMath1490.90257OpenAlexW3185254425MaRDI QIDQ2076862

Markus Sinnl

Publication date: 22 February 2022

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.07.035

zbMATH Keywords

combinatorial optimizationlocal searchdata miningbranch-and-cutBenders decomposition

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Algorithm for solving the generalized set cover problem for a special class of problems

Cites Work

• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Greedy randomized adaptive search procedures
• The maximum weighted submatrix coverage problem: a CP approach
• A new separation algorithm for the Boolean quadric and cut polytopes
• Biclustering in data mining
• Integer Programming
• Different Formulations for Solving the HeaviestK-Subgraph Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact and heuristic algorithms for the maximum weighted submatrix coverage problem