论文信息 - How easy is local search? - 字舞流文

How easy is local search?

Mihalis Yannakakis | Christos H. Papadimitriou | David S. Johnson | David S. Johnson | M. Yannakakis | C. Papadimitriou

[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[2] Christos Harilaos Papadimitriou,et al. The complexity of combinatorial optimization problems. , 1976 .

[3] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..