Journals in DBLP
Manuel A. Nunez , Robert M. Freund Condition measures and properties of the central trajectory of a linear program. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:1-28 [Journal ] Spyridon Kontogiorgis , Robert R. Meyer A variable-penalty alternating directions method for convex optimization. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:29-53 [Journal ] Christian Kanzow , Masao Fukushima Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:55-87 [Journal ] R. Baker Kearfott On proving existence of feasible points in equality constrained optimization problems. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:89-100 [Journal ] Francisco Barahona , David Jensen Plant location with minimum inventory. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:101-111 [Journal ] Jonathan Eckstein Approximate iterations in Bregman-function-based proximal algorithms. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:113-123 [Journal ] Jacek Gondzio Warm start of the primal-dual method applied in the cutting-plane scheme. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:125-143 [Journal ] Hubertus Th. Jongen , J.-J. Rückmann , O. Stein Generalized semi-infinite optimization: A first order optimality condition and examples. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:145-158 [Journal ] Paul Tseng Merit functions for semi-definite complementarity problems. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:159-185 [Journal ] Olvi L. Mangasarian Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:187-194 [Journal ] Ulrich Faigle , Walter Kern , Sándor P. Fekete , Winfried Hochstättler The nucleon of cooperative games and an algorithm for matching games. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:195-211 [Journal ] Lap Mui Ann Chan , David Simchi-Levi , Julien Bramel Worst-case analyses, linear programming and the bin-packing problem. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:213-227 [Journal ] Rüdiger Schultz , Leen Stougie , Maarten H. van der Vlerk Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:229-252 [Journal ] B. Curtis Eaves , Karl H. Schmedders A cellation of the Grassmann manifold. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:253-262 [Journal ] Sien Deng Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:263-276 [Journal ] Emilio Carrizosa , M. Muñoz-Márquez , Justo Puerto Location and shape of a rectangular facility in Realn Convexity properties. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:277-290 [Journal ] J. H. Reijnierse , Jos A. M. Potters On finding an envy-free Pareto-optimal division. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:291-311 [Journal ] Kazuo Murota Discrete convex analysis. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:313-371 [Journal ] Ladislav Luksan , Jan Vlcek A bundle-Newton method for nonsmooth unconstrained minimization. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:373-391 [Journal ] Masakazu Muramatsu Affine scaling algorithm fails for semidefinite programming. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:393-406 [Journal ] Josef Stoer , Martin Wechs Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:407-423 [Journal ] Vladimir I. Norkin , Georg Ch. Pflug , Andrezj Ruszczynski A branch and bound method for stochastic global optimization. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:425-450 [Journal ] Claus C. Carøe , Jørgen Tind L-shaped decomposition of two-stage stochastic programs with integer recourse. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:83, n:, pp:451-464 [Journal ]