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

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 297; číslo 3; s. 853 - 865
Hlavní autori:	Derval, Guillaume, Schaus, Pierre
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.03.2022
Predmet:	Combinatorial optimization Constraint programming Linear relaxation Maximum-sum submatrix Linear relaxation Combinatorial optimization Constraint programming Maximum-sum submatrix
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!