External Links

    Journal: Math. Program.

    Volume 90, Issue 3

    399 -- 427Claude Lemaréchal, Arnaud Renaud. A geometric study of duality gaps, with applications
    429 -- 457Oktay Günlük, Yves Pochet. Mixing mixed-integer inequalities
    459 -- 473Stephen J. Wright. On reduced convex QP formulations of monotone LCPs
    475 -- 506Norbert Ascheuer, Matteo Fischetti, Martin Grötschel. Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut
    507 -- 536Gongyun Zhao. A Log-Barrier method with Benders decomposition for solving two-stage stochastic linear programs
    537 -- 557Eduardo Uchoa, Marcus Poggi de Aragão. Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut
    559 -- 566Yehuda Vardi, Cun-Hui Zhang. A modified Weiszfeld algorithm for the Fermat-Weber location problem

    Volume 90, Issue 2

    205 -- 227Jos F. Sturm, Shuzhong Zhang. On sensitivity of central solutions in semidefinite programming
    229 -- 261E. Alper Yildirim, Michael J. Todd. Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
    263 -- 272Igor Averbakh. On the complexity of a class of combinatorial optimization problems with uncertainty
    273 -- 290Anna Galluccio, Martin Loebl, Jan Vondrák. Optimization via enumeration: a new algorithm for the Max Cut Problem
    291 -- 316Angel Corberán, Adam N. Letchford, José María Sanchis. A cutting plane algorithm for the General Routing Problem
    317 -- 351James V. Burke, Michael L. Overton. Variational analysis of non-Lipschitz spectral functions
    353 -- 371Satoru Iwata, Kazuo Murota. Combinatorial relaxation algorithm for mixed polynomial matrices
    373 -- 398Stéphane Alarie, Charles Audet, Brigitte Jaumard, Gilles Savard. Concavity cuts for disjoint bilinear programming

    Volume 90, Issue 1

    1 -- 25Krzysztof C. Kiwiel. Convergence and efficiency of subgradient methods for quasiconvex minimization
    27 -- 57David Avis, Antoine Deza. On the solitaire cone and its relationship to multi-commodity flows
    59 -- 69Michael J. Todd, Levent Tunçel, Yinyu Ye. Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
    71 -- 100Stephen J. Wright. On the convergence of the Newton/log-barrier method
    101 -- 111Yinyu Ye. A .699-approximation algorithm for Max-Bisection
    113 -- 145Garth P. McCormick, Christoph Witzgall. Logarithmic SUMT limits in convex programming
    147 -- 151Pierre Chardaire. The core and nucleolus of games: A note on a paper by Göthe-Lundgren et al
    153 -- 168K. A. Ariyawansa, W. C. Davidon, K. D. McKennon. On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations
    169 -- 203Reha H. Tütüncü. Quadratic convergence of potential-reduction methods for degenerate problems
    runs on