A research team from the Xi'an Institute of Optics and Precision Mechanics (XIOPM) of the Chinese Academy of Sciences, along with collaborators from the Institute National de la Recherche Scientifique ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results