| Article ID: | iaor20052796 |
| Country: | France |
| Volume: | 37 |
| Issue: | 2 |
| Start Page Number: | 67 |
| End Page Number: | 83 |
| Publication Date: | Apr 2003 |
| Journal: | RAIRO Operations Research |
| Authors: | Maculan Nelson, Passini Marcos de Mendona, Brito Jos Andr de Moura, Loiseau Irene |
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this approach to a telecommunications network planning problem.