A computational study of smoothing heuristics for the traveling salesman problem
From MaRDI portal
Publication:1576330
DOI10.1016/S0377-2217(99)00125-3zbMath0977.90070MaRDI QIDQ1576330
Steven P. Coy, Bruce L. Golden, Edward A. Wasil
Publication date: 27 January 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
Related Items
Problems of discrete optimization: challenges and main approaches to solve them, On the neighborhood structure of the traveling salesman problem generated by local search moves
Cites Work