The Bottleneck Traveling Salesman Problem

Abstract

The bottleneck traveling salesman problem seeks to minimize the maximum length arc over all Hamlltonlan cycles in a graph A probabdlStlC analysis is presented for random problems It is shown that the optimal ob.lectwe value can be closely approximated by a beta function Finally, effective solution techmques are developed and computational experience is reported