Conflict graphs in solving integer programming problems

  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},
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 e€ective and ecient 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. 


Publications citing this paper.
Showing 1-10 of 58 extracted citations


Publications referenced by this paper.
Showing 1-10 of 15 references

Sigismondi, MINTO, a Mixed INTeger Optimizer

  • G. L. Nemhauser, G.S.M.W.P. Savelsbergh
  • Operations Research Letters
  • 1994
Highly Influential
7 Excerpts

Solving airline crew-scheduling problems by branch-and-cut

  • K. Ho€man, M. W. Padberg
  • Management Science
  • 1993
Highly Influential
5 Excerpts

McZeal, M.W.P. Savelsbergh, An updated mixed integer programming library: MIPLIB 3.0, Technical Report TR98-03

  • R. E. Bixby, C.M.S. Ceria
  • Department of Computational and Applied…
  • 1996

Savelsbergh , A combined Lagrangian , linear programming , and implication heuristic for large - scale set partitioning problems

  • C. M. McZeal, M. W. P. Savelsbergh
  • Journal of Heuristics
  • 1995

Modeling and strong linear programs for mixed integer programming, in: S.W. Wallace (Ed.), Algorithms and Model Formulations in Mathematical Programming, NATO ASI Series, vol. F51

  • E. L. Johnson
  • 1989

Similar Papers

Loading similar papers…