期刊名称：Lecture Notes in Engineering and Computer Science
印刷版ISSN：2078-0958
电子版ISSN：2078-0966
出版年度：2019
卷号：2240
页码：132-136
出版社：Newswood and International Association of Engineers
摘要：Combinatorial optimization over graphs has been
the subject of research. Recently, the solution of such problems
by enumeration using a compact data structure called
the zero-suppressed binary decision diagram was proposed
and studied. The paper augments the existing frontier-based
search method of construction and puts forth a technique
for accommodating additional constraints during computation.
The shortest and longest path problems for the Osaka Metro
transit network are simultaneously solved as demonstration.
Furthermore, a comparison of the approach with a conventional
integer programming method is presented towards justifying
the effectiveness of the algorithm.
