An Approximation Algorithm for a Bottleneck Traveling Salesman Problem

DOI10.1007/11758471_23MaRDI QIDQ3434559zbMATH OpenOpenAlexFDO

Authors Manan Sanghi, Ming-Yang Kao

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758471_23

Mathematics Subject Classification ID

Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An approximation algorithm for a bottleneck traveling salesman problem
• On Gilmore-Gomory's open question for the bottleneck TSP.
• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• An Algorithm for the Bottleneck Traveling Salesman Problem

Cited in

(7)

• An approximation algorithm for a bottleneck traveling salesman problem
• On Gilmore-Gomory's open question for the bottleneck TSP.
• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• scientific article; zbMATH DE number 1688388 (Why is no real title available?)
• A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
• An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
• THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION

This page was built for publication: An Approximation Algorithm for a Bottleneck Traveling Salesman Problem

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