| Article ID: | iaor2000472 |
| Country: | United States |
| Volume: | 10 |
| Issue: | 4 |
| Start Page Number: | 427 |
| End Page Number: | 437 |
| Publication Date: | Sep 1998 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Nemhauser George L., Gu Zonghao, Savelsbergh Martin W.P. |
We investigate the algorithmic and implementation issues related to the effective and efficient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for 0–1 integer programming. We have tried various strategies on several test problems and we identify the best ones for use in practice.