GLÄSER, Maximilian, 2025. On the Proof Complexity of Linear Programming Based Branch-and-Bound. Darmstadt: Universitäts- und Landesbibliothek Darmstadt.
Elsevier - Harvard (with titles)Gläser, M., 2025. On the Proof Complexity of Linear Programming Based Branch-and-Bound. Universitäts- und Landesbibliothek Darmstadt, Darmstadt. https://doi.org/10.26083/tuprints-00028881
American Psychological Association 7th editionGläser, M. (ca. 2025). On the Proof Complexity of Linear Programming Based Branch-and-Bound [Universitäts- und Landesbibliothek Darmstadt; Cd]. https://doi.org/10.26083/tuprints-00028881
Springer - Basic (author-date)Gläser M (2025) On the Proof Complexity of Linear Programming Based Branch-and-Bound. Universitäts- und Landesbibliothek Darmstadt
Juristische Zitierweise (Stüber) (Deutsch)Gläser, Maximilian, On the Proof Complexity of Linear Programming Based Branch-and-Bound, Darmstadt 2025.