A computational study of smoothing heuristics for the traveling salesman problem
From MaRDI portal
Publication:1576330
DOI10.1016/S0377-2217(99)00125-3zbMath0977.90070OpenAlexW2073279712MaRDI QIDQ1576330
Bruce L. Golden, Edward A. Wasil, Steven P. Coy
Publication date: 27 January 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00125-3
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (2)
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
This page was built for publication: A computational study of smoothing heuristics for the traveling salesman problem
