Nogood Learning for Mixed Integer Programming

  title={Nogood Learning for Mixed Integer Programming},
  author={Tuomas Sandholm and Rob Shields},
Nogood learning has proven to be an effective CSP technique c ritical to success in today’s top SAT solvers. We extend the technique for use in integer progr amming and mixed integer programming. Our technique generates globally valid cutting p lanes for the 0-1 IP search algorithm from information learned through constraint propagation ( bounds propagation). Nogoods (cutting planes) are generated not only from infeasibility but also f rom bounding. All of our techniques are geared toward… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS


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

Bounds consistenc y te hniques for long linear constraints. InProceedings of TRICS: Techniques foR Implementing Constra i t programming Systems, a workshop of CP

Warwick Harvey, Joachim Schimpf
View 4 Excerpts
Highly Influenced

Integer and combinatorial optimization

Wiley interscience series in discrete mathematics and optimization • 1988
View 4 Excerpts
Highly Influenced

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Trans. Computers • 1999
View 12 Excerpts
Highly Influenced

Conflict analysis in mixed integer programming

Discrete Optimization • 2007
View 1 Excerpt

A fast pseudo-Boolean constraint solver

IEEE Trans. on CAD of Integrated Circuits and Systems • 2005
View 2 Excerpts

A special ordered se t approach to discontinuous piecewise linear optimization

Ismail de Farias, M Zhao, H Zhao

Similar Papers

Loading similar papers…