APA (7th ed.) Citation

Beideman, C., Chandrasekaran, K., & Wang, W. (2024). Counting and Enumerating Optimum Cut Sets for Hypergraph k -Partitioning Problems for Fixed k. Mathematics of Operations Research (INFORMS), 49(4), 2579. https://doi.org/10.1287/moor.2022.0259

Chicago Style (17th ed.) Citation

Beideman, Calvin, Karthekeyan Chandrasekaran, and Weihang Wang. "Counting and Enumerating Optimum Cut Sets for Hypergraph K -Partitioning Problems for Fixed K." Mathematics of Operations Research (INFORMS) 49, no. 4 (2024): 2579. https://doi.org/10.1287/moor.2022.0259.

MLA (9th ed.) Citation

Beideman, Calvin, et al. "Counting and Enumerating Optimum Cut Sets for Hypergraph K -Partitioning Problems for Fixed K." Mathematics of Operations Research (INFORMS), vol. 49, no. 4, 2024, p. 2579, https://doi.org/10.1287/moor.2022.0259.