Author:
Hou Yalin,Zhao Xin,Li Ting,Chen Jie,Li Qian,Li Yihong,Zheng Zheng
Reference17 articles.
1. TSPLIB-A Traveling Salesman Problem Library;G Reinelt;ORSA Journal on Computing,1991
2. The maximum edge biclique problem is NP-complete;R Peeters,2003
3. Neural" computation of decisions in optimization problems;J J Hopfield;Biological cybernetics
4. Complexity of protein folding;A S Fraenkel;Bulletin of Mathematical Biology,1993
5. Recognizing Union-Find trees is NP-complete;K Gelle;Information Processing Letters, Article,2018