Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour
- 30 April 1999
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 26 (4) , 321-327
- https://doi.org/10.1016/s0305-0548(98)00065-3
Abstract
No abstract availableKeywords
This publication has 0 references indexed in Scilit: