GLÄSER, Maximilian, PFETSCH, Marc E. und DISSER, Yann, 2024. On the Proof Complexity of Linear Programming Based Branch-and-Bound. München: Verlag Dr. Hut.
Elsevier - Harvard (with titles)Gläser, M., Pfetsch, M.E., Disser, Y., 2024. On the Proof Complexity of Linear Programming Based Branch-and-Bound. Verlag Dr. Hut, München.
American Psychological Association 7th editionGläser, M., Pfetsch, M. E., & Disser, Y. (ca. 2024). On the Proof Complexity of Linear Programming Based Branch-and-Bound (1. Auflage) [Book]. Verlag Dr. Hut.
Springer - Basic (author-date)Gläser M, Pfetsch ME, Disser Y (2024) On the Proof Complexity of Linear Programming Based Branch-and-Bound. Verlag Dr. Hut
Juristische Zitierweise (Stüber) (Deutsch)Gläser, Maximilian/ Pfetsch, Marc E./ Disser, Yann, On the Proof Complexity of Linear Programming Based Branch-and-Bound, München 2024.