This problem is said to be proposed by Knuth: given an m*n (m<n) maxtix A of rank m find its m*m submatrix B such that all elements of of B^{-1}A have absolute value at most one.
Source: Local Search in Combinatorial Optimization E. Aarts, K. Lenstra, chapter 2
No comments:
Post a Comment