A study of parallel branch-and-bound algorithms with best-bound-first search
From MaRDI portal
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.