Highly Influenced

# Conflict graphs in solving integer programming problems

@article{Atamtrk2000ConflictGI, title={Conflict graphs in solving integer programming problems}, author={Alper Atamt{\"u}rk and George L. Nemhauser and Martin W. P. Savelsbergh}, journal={European Journal of Operational Research}, year={2000}, volume={121}, pages={40-55} }

- Published 2000 in European Journal of Operational Research
DOI:10.1016/S0377-2217(99)00015-6

We report on the use of con ̄ict graphs in solving integer programs. A con ̄ict graph represents logical relations between binary variables. We develop algorithms and data structures that allow the eective and ecient construction, management, and use of dynamically changing con ̄ict graphs. Our computational experiments show that the techniques presented work very well. Ó 2000 Elsevier Science B.V. All rights reserved.