Dual variable based fathoming in dynamic programs for column generation

In this note, we aim at reducing the state space of dynamic programming algorithms used as column generators in solving the linear programming relaxation of set partitioning problems arising from practical applications. We propose a simple generic lower bounding criterion based on the respective dual optimal solution of the restricted master program. 2003 Elsevier B.V. All rights reserved.