2 citations · 2 across the 2 of their papers we have counts for
2 papers
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…
math.OC2008★ 2 cited
Column basis reduction, and decomposable knapsack problems
Bala Krishnamoorthy, Gabor Pataki
We propose a very simple preconditioning method for integer programming feasibility problems: replacing the problem b' <= Ax <= b, x \in Z^n with b' <= AUy <= b, y \in Z^n, where U…