-
The problem is known as NP hard no matter whether group sub lotting is admissible or not.
无论是对于成组加工情形还是分组情形,该问题都可以被证明是NP困难的。
youdao
-
The problem is known as NP hard no matter whether group sub lotting is admissible or not.
无论是对于成组加工情形还是分组情形,该问题都可以被证明是NP困难的。
youdao