Non-euclidean restricted memory level method for large-scale convex optimization Aharon Ben-TalArkadi Nemirovski OriginalPaper 29 December 2004 Pages: 407 - 456
Split closure and intersection cuts Kent AndersenGérard CornuéjolsYanjun Li OriginalPaper 29 December 2004 Pages: 457 - 493
Safe and tight linear estimators for global optimization Glencora BorradailePascal Van Hentenryck OriginalPaper 07 July 2004 Pages: 495 - 517
The two-dimensional cutting stock problem revisited Steven S. SeidenGerhard J. Woeginger OriginalPaper 20 August 2004 Pages: 519 - 530
A polyhedral study of nonconvex quadratic programs with box constraints Dieter VandenbusscheGeorge L. Nemhauser OriginalPaper 01 October 2004 Pages: 531 - 557
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints Dieter VandenbusscheGeorge L. Nemhauser OriginalPaper 01 October 2004 Pages: 559 - 575
Strengthening the Lovász bound for graph coloring Philippe Meurdesoif OriginalPaper 01 October 2004 Pages: 577 - 588
An improved semidefinite programming relaxation for the satisfiability problem Miguel F. Anjos OriginalPaper 01 October 2004 Pages: 589 - 608
A note on treating a second order cone program as a special case of a semidefinite program Chee-Khian SimGongyun Zhao OriginalPaper 20 August 2004 Pages: 609 - 613