GTSP-LIB

swMATH25565MaRDI QIDQ37303FDOQ37303

Author name not available (Why is that?)

Described by source

• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem

Cited In (9)

• Solving the traveling delivery person problem with limited computational time
• Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
• Recent advances in selection hyper-heuristics
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
• A survey of adaptive large neighborhood search algorithms and applications
• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
• Selective generalized travelling salesman problem

This page was built for software: GTSP-LIB