Combinatorial lower bounds for the Generalized Traveling Salesman Problem with Neighborhoods

Open Webpage

Jindriska Deckerová, Petr Vána, Jan Faigl

Published: 01 Jan 2024, Last Modified: 20 Jan 2025Expert Syst. Appl. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Novel Branch-and-Bound-based method providing the first lower bounds for the GTSPN.•GTSPN instances with high-dimensional regions are motivated by tasks with robotic manipulators.•Optimal solutions of the GTSPN instances with up to 12 sets.•Novel formulation of the GTSPN as the Mixed-Integer Second-Order Cone Programming.