| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9663971 | European Journal of Operational Research | 2005 | 4 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Marco E. Lübbecke,