2014•Information SciencesRequires access
A comparative study of suboptimal branch and bound algorithms
Songyot Nakariyakul
Open publisher page 19 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Songyot Nakariyakul
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Branch and bound, Algorithm, Upper and lower bounds, Branch and cut, Computer science, Set (abstract data type), Mathematics, Mathematical optimization