2 citations · 2 across the 5 of their papers we have counts for
5 papers
Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing
Luke Marshall, Prachi Shah, Santanu S. Dey
We propose a new pricing strategy for column generation (CG), referred to as Template pricing. This method is motivated by the desire to coordinate solutions of different pricing s…
Improving Full Strong Branching Decisions by Incorporating Additional Information
Prachi Shah, Santanu S. Dey
The full strong branching (FSB) rule is well known to produce extremely small branch-and-bound trees. This rule guides branching decisions based exclusively on the information rega…
Non-Monotonicity of Branching Rules with respect to Linear Relaxations
Prachi Shah, Santanu S. Dey, Marco Molinaro
Modern mixed-integer programming solvers use the branch-and-cut framework, where cutting planes are added to improve the tightness of the linear programming (LP) relaxation, with t…
Lower bound on size of branch-and-bound trees for solving lot-sizing problem
Santanu S. Dey, Prachi Shah
We show that there exists a family of instances of the lot-sizing problem, such that any branch-and-bound tree that solves them requires an exponential number of nodes, even in the…
A Theoretical and Computational Analysis of Full Strong-Branching
Santanu S. Dey, Yatharth Dubey, Marco Molinaro +1
Full strong-branching is a well-known variable selection rule that is known experimentally to produce significantly smaller branch-and-bound trees in comparison to all other known…