External Links

    Journal: Math. Program.

    Volume 122, Issue 2

    197 -- 223Florent Cadoux. Computing deep facet-defining disjunctive cuts for mixed-integer programming
    225 -- 246Etienne de Klerk, Renata Sotirov. Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
    247 -- 272James Luedtke, Shabbir Ahmed, George L. Nemhauser. An integer programming approach for linear programs with probabilistic constraints
    273 -- 299Richard H. Byrd, Frank E. Curtis, Jorge Nocedal. An inexact Newton method for nonconvex equality constrained optimization
    301 -- 347Truong Q. Bao, Boris S. Mordukhovich. Relative Pareto minimizers for multiobjective problems: existence and optimality conditions
    349 -- 378Dong Liang, Wilbert E. Wilhelm. A generalization of column generation to accelerate convergence
    379 -- 405Jiawang Nie, Kristian Ranestad, Bernd Sturmfels. The algebraic degree of semidefinite programming

    Volume 122, Issue 1

    1 -- 20Alper Atamtürk, Vishnu Narayanan. Conic mixed-integer rounding cuts
    21 -- 64J. William Helton, Jiawang Nie. Semidefinite representation of convex sets
    65 -- 85Anhua Lin. On a special class of regularized central paths for semidefinite programs
    87 -- 120S. Thomas McCormick, Satoru Fujishige. Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
    121 -- 154Kent Andersen, Yves Pochet. Coefficient strengthening: a tool for reformulating mixed-integer programs
    155 -- 196Nicholas I. M. Gould, Philippe L. Toint. Nonlinear programming without a penalty function or a filter
    runs on