ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
From MaRDI portal
Publication:4139973
DOI10.15807/jorsj.20.16zbMath0364.90075OpenAlexW2139579311MaRDI QIDQ4139973
Publication date: 1977
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.20.16
Related Items (2)
A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions ⋮ Using branch-and-bound algorithms to obtain suboptimal solutions
This page was built for publication: ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS