|
Volumn , Issue , 1990, Pages 438-445
|
On the complexity of local search.
a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTER PROGRAMMING--ALGORITHMS;
MATHEMATICAL PROGRAMMING, LINEAR;
NEURAL NETWORKS;
OPTIMIZATION;
HOPFIELD NETWORKS;
LOCAL SEARCH;
TRAVELING SALESMAN PROBLEM;
COMPUTER METATHEORY;
|
EID: 0025022879
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/100216.100274 Document Type: Conference Paper |
Times cited : (56)
|
References (25)
|