default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 83
Volume 83, 1998
- Manuel Núñez
, Robert M. Freund:
Condition measures and properties of the central trajectory of a linear program. 1-28 - Spyridon Kontogiorgis, Robert R. Meyer:
A variable-penalty alternating directions method for convex optimization. 29-53 - Christian Kanzow, Masao Fukushima:
Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities. 55-87 - R. Baker Kearfott:
On proving existence of feasible points in equality constrained optimization problems. 89-100 - Francisco Barahona, David L. Jensen:
Plant location with minimum inventory. 101-111 - Jonathan Eckstein:
Approximate iterations in Bregman-function-based proximal algorithms. 113-123 - Jacek Gondzio:
Warm start of the primal-dual method applied in the cutting-plane scheme. 125-143 - Hubertus Th. Jongen, Jan-J. Rückmann, Oliver Stein:
Generalized semi-infinite optimization: A first order optimality condition and examples. 145-158 - Paul Tseng:
Merit functions for semi-definite complementarity problems. 159-185 - Olvi L. Mangasarian:
Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification. 187-194 - Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler:
The nucleon of cooperative games and an algorithm for matching games. 195-211 - Lap Mui Ann Chan, David Simchi-Levi, Julien Bramel:
Worst-case analyses, linear programming and the bin-packing problem. 213-227 - 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. 229-252 - B. Curtis Eaves, Karl H. Schmedders:
A cellation of the Grassmann manifold. 253-262 - Sien Deng:
Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems. 263-276 - Emilio Carrizosa, M. Muñoz-Márquez, Justo Puerto:
Location and shape of a rectangular facility in Realn Convexity properties. 277-290 - J. H. Reijnierse, Jos A. M. Potters:
On finding an envy-free Pareto-optimal division. 291-311 - Kazuo Murota:
Discrete convex analysis. 313-371 - Ladislav Luksan, Jan Vlcek:
A bundle-Newton method for nonsmooth unconstrained minimization. 373-391 - Masakazu Muramatsu:
Affine scaling algorithm fails for semidefinite programming. 393-406 - Josef Stoer, Martin Wechs:
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. 407-423 - Vladimir I. Norkin, Georg Ch. Pflug, Andrzej Ruszczynski:
A branch and bound method for stochastic global optimization. 425-450 - Claus C. Carøe, Jørgen Tind:
L-shaped decomposition of two-stage stochastic programs with integer recourse. 451-464
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-11 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
