Branch-and-bound trees, integrality gaps and online optimization : a tale of algorithms and randomness

Additional Metadata
Promotor	D.N. Dadush (Daniel) , G. L. M. Cornelissen
Degree Grantor	Universiteit Utrecht
ISBN	9789039377000
Persistent URL	doi.org/10.33540/2424
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Borst, S. (2024, August 27). Branch-and-bound trees, integrality gaps and online optimization : a tale of algorithms and randomness. Retrieved from http://dx.doi.org/10.33540/2424

Publication