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 und 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 Mai 2025. P. 1-42. DOI 10.1007/s10107-025-02234-z.
Modern Language Association 9th editionSchade, J., M. Sinha, und 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, Mai 2025, S. 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 - HarvardSchade, J., Sinha, M. und 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, S. 1-42.