On the best principal submatrix problem
Let \(A = (a_{ij})\) be an \(n \times n\) matrix with entries from \(\Re \cup \{\ -\infty\ \}\\) and \(k \in \{\ 1, \ldots ,n \}\ \). The best principal submatrix problem (BPSM) is: Given matrix \(A\) and constant \(k\), find the biggest assignment problem value from all \(k \times k\) principal sub...
| Main Author: | |
|---|---|
| Published: |
University of Birmingham
2007
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.489572 |