Mustafa Kemal Tural

most citedOn the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.OCShow all

2 papers · 1 filter

math.OC2020★ 1 cited

On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound

Mustafa Kemal Tural

Given $n$ positive integers $a_{1}, a_{2}, \dots, a_{n}$ , and a positive integer right hand side $β$ , we consider the feasibility version of the subset sum problem which is the problem of d…

math.OC2009

Basis Reduction, and the Complexity of Branch-and-Bound

Gabor Pataki, Mustafa Tural

The classical branch-and-bound algorithm for the integer feasibility problem has exponential worst case complexity. We prove that it is surprisingly efficient on reformulated probl…