Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem)

DOI10.1007/S10559-013-9561-9MaRDI QIDQ465989zbMATH OpenOpenAlexFDO

Authors A. O. Ovezgeldyyev, A. V. Morozov

Publication date 24 October 2014

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-013-9561-9

zbMATH Keywords

traveling salesman problembranch and bound methodpostman problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• A branch-and-cut algorithm for the undirected rural postman problem
• A branch-and-bound algorithm for the time-dependent rural postman problem
• scientific article; zbMATH DE number 3914108
• Algorithms for the rural postman problem
• scientific article; zbMATH DE number 124052

This page was built for publication: Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem)

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