Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
From MaRDI portal
Publication:1662101
DOI10.1016/j.disopt.2013.07.001zbMath1474.90290MaRDI QIDQ1662101
Publication date: 17 August 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2013.07.001
symmetric traveling salesman problem; multistage insertion formulation; nonadjacency testing; pedigree polytope
Uses Software