Maximilian Gläser
Mitglied bis 2024.
- Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation
- Max Gläser, Marc Pfetsch
- Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
- https://doi.org/10.1137/1.9781611977912.132
- Preprint
- On computing small variable disjunction branch-and-bound trees
- Max Gläser, Marc Pfetsch
- Mathematical Programming (Series B)
- https://doi.org/10.1007/s10107-023-01968-y
- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs
- Max Gläser, Marc Pfetsch
- International Conference on Integer Programming and Combinatorial Optimization
- https://doi.org/10.1007/978-3-031-06901-7_22
- Preprint
- The PCP Theorem, 15.06.20, Darmstadt
- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs, 25.05.22, Darmstadt, Seminar der Optimierung
- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs, 28.07.22, Eindhoven, IPCO 2022
- On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs, 08.09.22, Karlsruhe, OR 2022
- A Closer Look at the Non-Automatizability of Branch-and-Bound (Elevator Pitch), 11.01.23, Aussois, 25th Aussois COW
- Lower Bounds for Branch-and-Bound with General Disjunctions via Monotone Real Interpolation, 14.08.23, Eindhoven, FRICO 2023
- Lower Bounds for Branch-and-Bound with General Disjunctions via Monotone Real Interpolation, 29.11.23, Darmstadt, Seminar der Didaktik
- Lower Bounds for Branch-and-Bound with General Disjunctions via Monotone Real Interpolation, 09.01.24, Alexandria (Washington), SODA 2024
- Lower Bounds for Branch-and-Bound with General Disjunctions via Monotone Real Interpolation, 20.02.24, TU München
- Lower Bounds for Branch-and-Bound with General Disjunctions via Monotone Real Interpolation, 12.06.24, Darmstadt, DAIS Seminar
| Discrete Optimization | Sommersemester 2024 |
| Einführung in die Programmierung 1 |
Wintersemester 2023/2024 |
| Discrete Optimization | Sommersemester 2023 |
| Einführung in die Programmierung 1 |
Wintersemester 2022/2023 |
| Diskrete Optimierung | Sommersemester 2022 |
| Einführung in die Programmierung 1 |
Wintersemester 2021/2022 |
|
Algorithmic Discrete Mathematics, Höhere Mathematik 2 |
Sommersemester 2021 |
|
Einführung in die Programmierung 1, Höhere Mathematik 1 |
Wintersemester 2020/2021 |
| Mathematik für Elektrotechnik 2 | Sommersemester 2020 |
