DocumentCode :
2182651
Title :
How easy is local search?
Author :
Johnson, David S. ; Papadimitriou, Christos H. ; Yannakakis, Mihalis
fYear :
1985
fDate :
21-23 Oct. 1985
Firstpage :
39
Lastpage :
42
Keywords :
Computational modeling; Cost function; Ellipsoids; Explosions; Linear programming; Partitioning algorithms; Pathology; Polynomials; Simulated annealing; Traveling salesman problems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1985., 26th Annual Symposium on
Conference_Location :
Portland, OR, USA
ISSN :
0272-5428
Print_ISBN :
0-8186-0644-4
Type :
conf
DOI :
10.1109/SFCS.1985.31
Filename :
4568125
Link To Document :
بازگشت