1 paper
Kun Lei, Peng Guo, Yi Wang +2
For NP-hard combinatorial optimization problems, it is usually difficult to find high-quality solutions in polynomial time. The design of either an exact algorithm or an approximat…