On the Membership Problem of the Pedigree Polytope

On approximating a new generalization of traveling salesman problem

“…This study primarily focuses on the case that edge distances are symmetric, where the distance holds for any two vertices and in the input graph [10] . For investigations on the asymmetric case, readers can refer to recent literature [11] , [12] , [13] .…”