- Alternative title
-
Über die Beweiskomplexität des Branch-and-Bound Verfahrens der linearen Programmierung
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Darmstadt, Technische Universität Darmstadt, Dissertation, 2024
- Event
-
Veröffentlichung
- (where)
-
Darmstadt
- (who)
-
Universitäts- und Landesbibliothek
- (when)
-
2025
- Creator
- Contributor
- DOI
-
10.26083/tuprints-00028881
- URN
-
urn:nbn:de:tuda-tuprints-288811
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:25 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Gläser, Maximilian
- Pfetsch, Marc E.
- Disser, Yann
- Dadush, Daniel
- Universitäts- und Landesbibliothek
Time of origin
- 2025
Other Objects (12)
Why are Proof Complexity Lower Bounds Hard?
Descision-Based Approaches - Descision Trees / Branch and Bound / Constraint Programming
Machine learning augmented branch and bound for mixed integer linear programming
Proof Complexity 2020
Local search versus linear programming to detect monotonicity in simplicial branch and bound
Holographic complexity bounds
Lifting Applied to Proof Complexity
Proof Complexity for SAT practitioner
Proof Complexity of Modal Resolution
Descision-Based Approaches - Branch-and-Bound
Non-classical aspects in proof complexity
Proof Complexity of Quantified Boolean Formulas
Why are Proof Complexity Lower Bounds Hard?
Descision-Based Approaches - Descision Trees / Branch and Bound / Constraint Programming
Machine learning augmented branch and bound for mixed integer linear programming
Proof Complexity 2020
Local search versus linear programming to detect monotonicity in simplicial branch and bound
Holographic complexity bounds
Lifting Applied to Proof Complexity
Proof Complexity for SAT practitioner
Proof Complexity of Modal Resolution
Descision-Based Approaches - Branch-and-Bound
Non-classical aspects in proof complexity
Proof Complexity of Quantified Boolean Formulas
Why are Proof Complexity Lower Bounds Hard?
Descision-Based Approaches - Descision Trees / Branch and Bound / Constraint Programming
Machine learning augmented branch and bound for mixed integer linear programming
Proof Complexity 2020
Local search versus linear programming to detect monotonicity in simplicial branch and bound
Holographic complexity bounds
Lifting Applied to Proof Complexity
Proof Complexity for SAT practitioner
Proof Complexity of Modal Resolution
Descision-Based Approaches - Branch-and-Bound
Non-classical aspects in proof complexity