default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 31
Volume 31, Number 1, January 1985
- George B. Dantzig, Alan J. Hoffman, T. C. Hu:
Triangulations (tilings) and certain block triangular matrices. 1-14 - Gerard G. L. Meyer:
Convergence properties of relaxation algorithms. 15-24 - John R. Birge
:
Aggregation bounds in stochastic linear programming. 25-41 - Suvrajeet Sen, Hanif D. Sherali:
On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs. 42-56 - Philip C. Jones, Romesh Saigal, Michael H. Schneider:
Computing nonlinear network equilibria. 57-66 - Sunita Agarwal, A. K. Mittal, Prabha Sharma:
A decomposition algorithm for linear relaxation of the weighted r-covering problem. 67-77 - Bezalel Gavish, Hasan Pirkul:
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. 78-105 - Romesh Saigal, Richard E. Stone:
Proper, reflecting and absorbing facts of complementary cones. 106-117 - Anthony V. Fiacco:
Mathematical programming study 21 - Sensitivity, Stability and parametric analysis. 118-121
Volume 31, Number 2, June 1985
- Michael J. Todd:
'Fat' triangulations, or solving certain nonconvex matrix optimization problems. 123-136 - Thomas R. Jefferson, Carlton H. Scott:
Quadratic geometric programming with application to machining economics. 137-152 - Arne Drud:
CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems. 153-191 - Douglas J. White:
Vector maximisation and lagrange multipliers. 192-205 - Jong-Shi Pang:
Asymmetric variational inequality problems over product sets: Applications and iterative methods. 206-219 - Ya-Xiang Yuan:
Conditions for convergence of trust region algorithms for nonsmooth optimization. 220-228 - M. C. Cheng:
Generalized theorems for permanent basic and nonbasic variables. 229-234 - Masakazu Kojima, Shin'ichi Oishi, Yuzo Sumi, Kazuo Horiuchi:
A PL homotopy continuation method with the use of an odd map for the artificial level. 235-244
Volume 31, Number 3, October 1985
- Sanjo Zlobec:
Input optimization: I. Optimal realizations of mathematical models. 245-268 - Ya-Xiang Yuan:
On the superlinear convergence of a trust region algorithm for nonsmooth optimization. 269-285 - Jinde Wang:
Distribution sensitivity analysis for stochastic programs with complete recourse. 286-297 - Arie Tamir:
A finite algorithm for the continuousp-center location problem on a graph. 298-306 - Alfonso Reinoza:
Solving generalized equations via homotopies. 307-320 - Myriam Preissmann, Dominique de Werra:
A note on strong perfectness of graphs. 321-326 - Cu Duong Ha:
Stability of the linear complementarity problem at a solution point. 327-338 - Stephen J. Grotzinger:
Supports and convex envelopes. 339-347 - Allen A. Goldstein:
The complexity of an lp method for discrete Tchebycheff approximation in exact arithmetic. 348-356 - Ron S. Dembo, John G. Klincewicz:
Dealing with degeneracy in reduced gradient algorithms. 357-363
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-11-14 21:07 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:
