A beam search for the equality generalized symmetric traveling salesman problem

DOI10.1051/RO/2021148MaRDI QIDQ5034720zbMATHOpenAlexFDO

Authors Ibtissem Ben Nejma, Rym M'Hallah

Publication date 21 February 2022

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2021148

zbMATH Keywords

beam searchLin-Kernighan heuristicsymmetric traveling salesman\(k\)-optgeneralized traveling salesman

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• The symmetric generalized traveling salesman polytope
• scientific article; zbMATH DE number 6867742
• New classes of efficiently solvable generalized traveling salesman problems
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

Cited in

(1)

• A comprehensive survey on the generalized traveling salesman problem

This page was built for publication: A beam search for the equality generalized symmetric traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034720)