TU Darmstadt
ULB
TUprints
Browse by Person
Up a level |
Number of items: 1.
Gläser, Maximilian (2025)
On the Proof Complexity of Linear Programming Based Branch-and-Bound.
doi: 10.26083/tuprints-00028881
Book, Secondary publication, Publisher's Version