Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.

•A traveling salesman problem with additional constraints is considered.•A new model based on path segments is proposed.•Position- and distance-dependent reformulations are studied.•Branch-and-cut algorithms based on the proposed models are developed.•An extensive computational comparison of the different approaches is provided.