Abstract: Combinatorial optimization problems are frequently classified as NP-hard, which means that the time needed to find the optimal solution generally increases exponentially with the problem ...
Abstract: Emerging computer based on quantum [1] or CMOS technologies [2 –5] has gained attention as an alternative for solving non-deterministic polynomial-time hard combinatorial optimization ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results