Minimizing the number of one-paths in BDDs by an evolutionary algorithm

Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler. Minimizing the number of one-paths in BDDs by an evolutionary algorithm. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2003, 8 - 12 December 2003, Canberra, Australia. pages 1724-1731, IEEE, 2003. [doi]

@inproceedings{HilgemeierDD03-0,
  title = {Minimizing the number of one-paths in BDDs by an evolutionary algorithm},
  author = {Mario Hilgemeier and Nicole Drechsler and Rolf Drechsler},
  year = {2003},
  doi = {10.1109/CEC.2003.1299881},
  url = {https://doi.org/10.1109/CEC.2003.1299881},
  researchr = {https://researchr.org/publication/HilgemeierDD03-0},
  cites = {0},
  citedby = {0},
  pages = {1724-1731},
  booktitle = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2003, 8 - 12 December 2003, Canberra, Australia},
  publisher = {IEEE},
}