1 problem
- 0 votes0 replies0 views
NP-hardness conjecture for optimization over intersected rank-one row- and column-bounded sets
Let , and let and denote the rank-one nonneg…
NP-hardness conjecture for optimization over intersected rank-one row- and column-bounded sets
Let , and let and denote the rank-one nonneg…