17 citations · 35 across the 9 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2016★ 1 cited
Thinner is not Always Better: Cascade Knapsack Problems
Bala Krishnamoorthy
In the context of branch-and-bound (B&B) for integer programming (IP) problems, a direction along which the polyhedron of the IP has minimum width is termed a thin direction. We de…
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…