Arc Routing Based on the Zero-Suppressed Binary Decision Diagram

• المؤلفون الرئيسيون: Tan, Renzo Roel P, Sikora, Florian, Ikeda, Kazushi, See, Kyle Stephen S
• التنسيق: text
• منشور في: Archīum Ateneo 2020
• الموضوعات: arc routing; enumeration algorithm; frontier-based search; graph optimization; rural postman problem; zero-suppressed binary decision diagram; Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/167; https://link.springer.com/chapter/10.1007/978-981-15-8273-8_9
• المؤسسة: Ateneo De Manila University

A wide range of problems in operations research falls under arc routing problems, a domain which focuses on arc or edge features rather than node or vertex attributes. The undirected rural postman problem is a well-known problem in arc routing that seeks to determine a minimum cost walk that travers...