scientific article; zbMATH DE number 1131767

MaRDI QIDQ4382797zbMATH OpenFDO

Authors Longjun Wu, Cheng'en Yang

Publication date 12 May 1998

zbMATH Keywords

algorithmoptimal solutionstravelling salesman location problem

Mathematics Subject Classification ID

Trees (05C05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• Minmax \(p\)-traveling salesmen location problems on a tree
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
• Optimal locations and districts of two traveling salesmen on a tree
• Minisum location of a travelling salesman on simple networks
• The delivery man problem on a tree network

Cited in

(9)

• A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
• A polynomial algorithm for deciding the validity of an electrical distribution tree
• The travelling salesman and the PQ-tree.
• Optimal locations and districts of two traveling salesmen on a tree
• scientific article; zbMATH DE number 4083394 (Why is no real title available?)
• The Traveler's Problem
• A polynomial algorithm for thep-centdian problem on a tree
• An Improved Algorithm for the Traveler′s Problem

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 Q4382797)