American Psychological Association 6th edition

Schade, J., Sinha, M., & Weltge, S. (2025). Lower bounds on the complexity of mixed-integer programs for stable set and knapsack. Mathematical Programming: A Publication of the Mathematical Optimization Society, 1-42. https://doi.org/10.1007/s10107-025-02234-z

ISO-690 (author-date, English)

SCHADE, Jamico, SINHA, Makrand and WELTGE, Stefan, 2025. Lower bounds on the complexity of mixed-integer programs for stable set and knapsack. Mathematical Programming: A Publication of the Mathematical Optimization Society. 19 May 2025. P. 1-42. DOI 10.1007/s10107-025-02234-z.

Modern Language Association 9th edition

Schade, J., M. Sinha, and S. Weltge. “Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack”. Mathematical Programming: A Publication of the Mathematical Optimization Society, May 2025, pp. 1-42, https://doi.org/10.1007/s10107-025-02234-z.

Mohr Siebeck - Recht (Deutsch - Österreich)

Schade, Jamico/Sinha, Makrand/Weltge, Stefan: Lower bounds on the complexity of mixed-integer programs for stable set and knapsack, Mathematical Programming: A Publication of the Mathematical Optimization Society 2025, 1-42.

Emerald - Harvard

Schade, J., Sinha, M. and Weltge, S. (2025), “Lower bounds on the complexity of mixed-integer programs for stable set and knapsack”, Mathematical Programming: A Publication of the Mathematical Optimization Society, pp. 1-42.

Warning: These citations may not always be 100% accurate.