Local search and the local structure of NP-complete problems
- 1 October 1992
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 12 (4) , 235-243
- https://doi.org/10.1016/0167-6377(92)90049-9
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- How easy is local search?Journal of Computer and System Sciences, 1988
- Some Examples of Difficult Traveling Salesman ProblemsOperations Research, 1978