scientific article; zbMATH DE number 4189104

MaRDI QIDQ5753447zbMATH OpenFDO

Authors

Publication date 1990

zbMATH Keywords

branch and bound techniquescombinatorial optimizationcomparison of methodslocal search algorithmsnumerical examplessimulated annealingsymmetric traveling salesman problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 3908167
• scientific article; zbMATH DE number 4031726
• scientific article; zbMATH DE number 177832
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• Branch-and-bound algorithm for symmetric travelling salesman problem

Cited in

(9)

• Predatory search algorithm with restriction of solution distance
• Branch-and-check approaches for the tourist trip design problem with rich constraints
• Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
• scientific article; zbMATH DE number 3908167 (Why is no real title available?)
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
• scientific article; zbMATH DE number 646750 (Why is no real title available?)
• scientific article; zbMATH DE number 4121788 (Why is no real title available?)
• Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm

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