scientific article; zbMATH DE number 4031726

MaRDI QIDQ3772248zbMATH OpenFDO

Authors M. M. Telemtaev

Publication date 1986

zbMATH Keywords

branch and bound methodtravelling salesman problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 7059568
• An Algorithm for the Bottleneck Traveling Salesman Problem
• scientific article; zbMATH DE number 3882227
• scientific article; zbMATH DE number 1499191
• scientific article; zbMATH DE number 598850
• A method for solving traveling-salesman problems
• The traveling salesman problem. Approximate algorithms
• scientific article; zbMATH DE number 1145369
• The traveling-salesman problem
• An approximation algorithm for the maximum traveling salesman problem

Cited in

(12)

• scientific article; zbMATH DE number 4018804 (Why is no real title available?)
• The travelling salesman problem: selected algorithms and heuristics†
• scientific article; zbMATH DE number 4191408 (Why is no real title available?)
• A branch and bound algorithm for traveling salesman problem
• scientific article; zbMATH DE number 3908167 (Why is no real title available?)
• scientific article; zbMATH DE number 598850 (Why is no real title available?)
• scientific article; zbMATH DE number 646750 (Why is no real title available?)
• scientific article; zbMATH DE number 1499191 (Why is no real title available?)
• An improved branching rule for the symmetric travelling salesman problem
• Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
• scientific article; zbMATH DE number 7059568 (Why is no real title available?)
• scientific article; zbMATH DE number 4189104 (Why is no real title available?)

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