The following pages link to A good submatrix is hard to find (Q1836717):
Displayed 10 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)
- Quasioptimality of maximum-volume cross interpolation of tensors (Q2250929) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- Extracting embedded generalized networks from linear programming problems (Q3693261) (← links)
- Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection (Q5323076) (← links)