Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
A parallel primal-dual simplex algorithm
Operations Research Letters
An exact algorithm for IP column generation
Operations Research Letters
Hi-index | 0.01 |
Column generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information is generated at each iteration of the simplex algorithm. This paper shows that, even if the number of variables is low enough for explicit inclusion in the model with the available technology, it may still be more efficient to resort to column generation for some class of problems.