Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem

Roman Kolpakov, Mikhail Posypkin. Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem. Central Europ. J. Computer Science, 11(1):116-126, 2021. [doi]

Abstract

Abstract is missing.