Hybrid Nested Partitions Method for the Traveling Salesman Problem

DOI10.1007/978-3-642-54924-3_6zbMath1356.90167OpenAlexW22125805MaRDI QIDQ2963701

Decai Zong, Kang-Kang Wang

Publication date: 21 February 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54924-3_6

zbMATH Keywords

traveling salesman problemlocal search algorithmnested partitions method3-opt algorithmLin-Kernighan algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• Unnamed Item

Cites Work

• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Hybrid Nested Partitions Method for the Traveling Salesman Problem