scientific article; zbMATH DE number 500420

MaRDI QIDQ4278967zbMATH OpenFDO

Authors Qifan Yang

Publication date 3 January 1995

zbMATH Keywords

bottleneck TSP problemmatrices with non-increasing columnstraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
• Maximizing traveling salesman problem for special matrices
• Efficiently solvable special cases of bottleneck travelling salesman problems
• Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
• THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES

Cited in

(1)

• An O(n) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices

This page was built for publication:

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