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-9zbMath1306.90135MaRDI QIDQ465989

J. Herrera, D. Rodríguez-Gómez

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 problem; branch and bound method; postman problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization