External Links

    Journal: Math. Program.

    Volume 102, Issue 3

    407 -- 456Aharon Ben-Tal, Arkadi Nemirovski. Non-euclidean restricted memory level method for large-scale convex optimization
    457 -- 493Kent Andersen, Gérard Cornuéjols, Yanjun Li. Split closure and intersection cuts
    495 -- 517Glencora Borradaile, Pascal Van Hentenryck. Safe and tight linear estimators for global optimization
    519 -- 530Steven S. Seiden, Gerhard J. Woeginger. The two-dimensional cutting stock problem revisited
    531 -- 557Dieter Vandenbussche, George L. Nemhauser. A polyhedral study of nonconvex quadratic programs with box constraints
    559 -- 575Dieter Vandenbussche, George L. Nemhauser. A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
    577 -- 588Philippe Meurdesoif. Strengthening the Lovász Theta(G) bound for graph coloring
    589 -- 608Miguel F. Anjos. An improved semidefinite programming relaxation for the satisfiability problem
    609 -- 613Chee-Khian Sim, Gongyun Zhao. A note on treating a second order cone program as a special case of a semidefinite program
    runs on