APA (7th ed.) Citation

Kaji, T., & Ohuchi, A. (1997). A tabu search approach to the optimal sequential partitions of directed acyclic graphs. Electrical engineering in Japan, 119(4), 42-51. https://doi.org/10.1002/(SICI)1520-6416(199706)119:4<42::AID-EEJ5>3.0.CO;2-J

Chicago Style (17th ed.) Citation

Kaji, Taichi, and Azuma Ohuchi. "A Tabu Search Approach to the Optimal Sequential Partitions of Directed Acyclic Graphs." Electrical Engineering in Japan 119, no. 4 (1997): 42-51. https://doi.org/10.1002/(SICI)1520-6416(199706)119:4<42::AID-EEJ5>3.0.CO;2-J.

MLA (9th ed.) Citation

Kaji, Taichi, and Azuma Ohuchi. "A Tabu Search Approach to the Optimal Sequential Partitions of Directed Acyclic Graphs." Electrical Engineering in Japan, vol. 119, no. 4, 1997, pp. 42-51, https://doi.org/10.1002/(SICI)1520-6416(199706)119:4<42::AID-EEJ5>3.0.CO;2-J.