A data-guided lexisearch algorithm for the bottleneck travelling salesman problem

DOI10.1504/IJOR.2011.041857zbMath1254.90266OpenAlexW2149740490MaRDI QIDQ1758845

Zakir Hussain Ahmed

Publication date: 16 November 2012

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2011.041857

zbMATH Keywords

boundNP-completealphabet tablebottleneck travelling salesman problemtourdata-guided lexisearch

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

A data-guided lexisearch algorithm for the asymmetric traveling salesman problem ⋮ An exact algorithm for the clustered travelling salesman problem

Uses Software

• TSPLIB

This page was built for publication: A data-guided lexisearch algorithm for the bottleneck travelling salesman problem