Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems

Wen-Yang Ku, J. Christopher Beck. Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems. In Helmut Simonis, editor, Integration of AI and OR Techniques in Constraint Programming - 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings. Volume 8451 of Lecture Notes in Computer Science, pages 334-350, Springer, 2014. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.