| Article ID: | iaor2001482 |
| Country: | Netherlands |
| Volume: | 121 |
| Issue: | 1 |
| Start Page Number: | 40 |
| End Page Number: | 55 |
| Publication Date: | Feb 2000 |
| Journal: | European Journal of Operational Research |
| Authors: | Nemhauser George L., Savelsbergh Martin W.P., Atamtrk Alper |
We report on the use of conflict graphs in solving integer programs. A conflict graph represents logical relations between binary variables. We develop algorithms and data structures that allow the effective and efficient construction, management, and use of dynamically changing conflict graphs. Our computational experiments show that the techniques presented work very well.