Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach (Q2060395)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach |
scientific article; zbMATH DE number 7442939
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach |
scientific article; zbMATH DE number 7442939 |
Statements
Maximal-sum submatrix search using a hybrid constraint programming/linear programming approach (English)
0 references
13 December 2021
0 references
combinatorial optimization
0 references
maximum-sum submatrix
0 references
linear relaxation
0 references
constraint programming
0 references
0 references
0 references
