- Weitere Titel
-
Über die Beweiskomplexität des Branch-and-Bound Verfahrens der linearen Programmierung
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Darmstadt, Technische Universität Darmstadt, Dissertation, 2024
- Ereignis
-
Veröffentlichung
- (wo)
-
Darmstadt
- (wer)
-
Universitäts- und Landesbibliothek
- (wann)
-
2025
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.26083/tuprints-00028881
- URN
-
urn:nbn:de:tuda-tuprints-288811
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:25 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Gläser, Maximilian
- Pfetsch, Marc E.
- Disser, Yann
- Dadush, Daniel
- Universitäts- und Landesbibliothek
Entstanden
- 2025
Ähnliche Objekte (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