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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 297; H. 3; S. 853 - 865
Hauptverfasser:	Derval, Guillaume, Schaus, Pierre
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.03.2022
Schlagworte:	Combinatorial optimization Constraint programming Linear relaxation Maximum-sum submatrix Linear relaxation Combinatorial optimization Constraint programming Maximum-sum submatrix
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!