On the Utility of the Zero-Suppressed Binary Decision Diagram

Autor: Tan, Renzo_Roel_Perez

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::71da725dedf77b3b51aae70b8b7b4ab5
http://hdl.handle.net/10061/14637

Comprehensive representation of feasible combinations of alternatives for dynamic production planning using Zero-Suppressed Binary Decision Diagram

Autor: Keita TAKAHASHI, Masahiko ONOSATO, Fumiki TANAKA

Publikováno v: Journal of Advanced Mechanical Design, Systems, and Manufacturing, Vol 8, Iss 4, Pp JAMDSM0061-JAMDSM0061 (2014)

The goal of the production-planning problem is to find the optimal solution from combinations that satisfy constraints. Traditionally, production-planning problems have been treated separately, due to the problem size and complex constraints, whereas

Externí odkaz: https://doaj.org/article/525c109f837c4eb7b5c0083a860524ae

Arc Routing Based on the Zero-Suppressed Binary Decision Diagram

Autor: Kazushi Ikeda, Kyle Stephen S. See, Florian Sikora, Renzo Roel P. Tan

Publikováno v: Transactions on Engineering Technologies
Transactions on Engineering Technologies, Oct 2020, Singapore, Singapore. pp.105-120, ⟨10.1007/978-981-15-8273-8_9⟩
Transactions on Engineering Technologies, Springer Singapore, pp.105-120, 2021, ⟨10.1007/978-981-15-8273-8_9⟩
Transactions on Engineering Technologies ISBN: 9789811582721

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 s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef3ee10e762f6d01d8b14064fd29452b
https://hal.archives-ouvertes.fr/hal-03217109

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Enumeration of Floor Plans Based on a Zero-Suppressed Binary Decision Diagram

Autor: Atsushi Takizawa, Yushi Miyata, Naoki Katoh

Publikováno v: International Journal of Architectural Computing. 13:25-44

This paper presents novel algorithms for enumerating architectural floor plans. The enumeration approach attempts to generate all feasible solutions that satisfy given constraints. Therefore, such a method might usefully reveal the potential diversit

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e9652288afd96833b073eb848f1dcf23
https://doi.org/10.1260/1478-0771.13.1.25