Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem)
From MaRDI portal
Publication:465989
DOI10.1007/s10559-013-9561-9zbMath1306.90135OpenAlexW2167800904MaRDI 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
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)