APA (7th ed.) Citation

Del Pia, A., Linderoth, J., & Zhu, H. (2024). On the complexity of separating cutting planes for the knapsack polytope. Mathematical Programming, 206(1/2), 33. https://doi.org/10.1007/s10107-023-01963-3

Chicago Style (17th ed.) Citation

Del Pia, Alberto, Jeff Linderoth, and Haoran Zhu. "On the Complexity of Separating Cutting Planes for the Knapsack Polytope." Mathematical Programming 206, no. 1/2 (2024): 33. https://doi.org/10.1007/s10107-023-01963-3.

MLA (9th ed.) Citation

Del Pia, Alberto, et al. "On the Complexity of Separating Cutting Planes for the Knapsack Polytope." Mathematical Programming, vol. 206, no. 1/2, 2024, p. 33, https://doi.org/10.1007/s10107-023-01963-3.