Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach

•The Maximum-Sum Submatrix problem aims at finding submatrices of maximum sum.•Two upper bounds are proposed for the problem, both based on linear relaxations.•A reduced-cost filtering algorithm is proposed for constraint programming solvers.•Large instances are tackled using Large Neighborhood Sear...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 297; no. 3; pp. 853 - 865
Main Authors:	Derval, Guillaume, Schaus, Pierre
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.03.2022
Subjects:	Combinatorial optimization Constraint programming Linear relaxation Maximum-sum submatrix Linear relaxation Combinatorial optimization Constraint programming Maximum-sum submatrix
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!