The following pages link to A good submatrix is hard to find (Q1836717):
Displaying 12 items.
- An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
- The practical conversion of linear programmes to network flow models (Q757237) (← links)
- Generalizing the column-row matrix decomposition to multi-way arrays (Q977471) (← links)
- A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
- Extracting pure network submatrices in linear programs using signed graphs. (Q1427813) (← links)
- Rectangular maximum-volume submatrices and their applications (Q1680300) (← links)
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format (Q2159450) (← links)
- Quasioptimality of maximum-volume cross interpolation of tensors (Q2250929) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals (Q2698750) (← links)
- Linear optimization over homogeneous matrix cones (Q6047504) (← links)
