Abstract: In combinatorial optimization problems with one-hot constraints, the number of binary variables that have the value of one in the feasible solution becomes constant and small, so it is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback