APA (7th ed.) Citation

Schade, J., Sinha, M., & Weltge, S. (2026). Lower bounds on the complexity of mixed-integer programs for stable set and knapsack. Mathematical Programming, 216(1/2), 135. https://doi.org/10.1007/s10107-025-02234-z

Chicago Style (17th ed.) Citation

Schade, Jamico, Makrand Sinha, and Stefan Weltge. "Lower Bounds on the Complexity of Mixed-integer Programs for Stable Set and Knapsack." Mathematical Programming 216, no. 1/2 (2026): 135. https://doi.org/10.1007/s10107-025-02234-z.

MLA (9th ed.) Citation

Schade, Jamico, et al. "Lower Bounds on the Complexity of Mixed-integer Programs for Stable Set and Knapsack." Mathematical Programming, vol. 216, no. 1/2, 2026, p. 135, https://doi.org/10.1007/s10107-025-02234-z.