23 citations · 82 across the 21 of their papers we have counts for
Showing 2008 · math.OCShow all
2 papers · 2 filters
math.OC2008★ 1 cited
Parallel Approximation and Integer Programming Reformulation
Gabor Pataki, Mustafa Tural
We show that in a knapsack feasibility problem an integral vector , which is short, and near parallel to the constraint vector gives a branching direction with small integer wid…
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…