Basis Reduction and the Complexity of Branch-and-Bound

Autor:	Gábor Pataki, Mustafa Tural, Erick B. Wong
Rok vydání:	2010
Zdroj:	Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms.
DOI:	10.1137/1.9781611973075.100
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::671a8e76e620459f9c65132d4d7136a6 https://doi.org/10.1137/1.9781611973075.100 Zobrazit plný text záznamu