![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Mathematical Programming, Volume 56
Volume 56, 1992
- S. Frank Chang, S. Thomas McCormick:
A hierarchical algorithm for making sparse matrices sparser. 1-30 - Shinji Mizuno:
A new polynomial time method for a linear complementarity problem. 31-43 - Douglas J. White:
A linear programming approach to solving bilinear programmes. 45-50 - Hiroshi Konno, Takahito Kuno:
Linear multiplicative programming. 51-64 - Jerzy Kyparisis, Chi-Ming Ip:
Solution behavior for parametric implicit complementarity problems. 65-70 - Chi-Ming Ip, Jerzy Kyparisis:
Local convergence of quasi-Newton methods for B-differentiable equations. 71-89 - Silvia Vogel:
On stability in multiobjective programming - A stochastic approach. 91-119 - Michel Deza, Monique Laurent:
Facets for the cut cone I. 121-160 - Michel Deza, Monique Laurent:
Facets for the cut cone II: Clique-web inequalities. 161-188 - Thomas F. Coleman, Yuying Li:
A globally and quadratically convergent affine scaling method for linear l1 problems. 189-222 - Jean-Pierre Crouzeix, Jacques A. Ferland, Siegfried Schaible:
Generalized convexity on affine subspaces with an application to potential functions. 223-232 - Kazunori Yokoyama:
epsilon-optimality criteria for convex programming problems via exact penalty functions. 233-243 - John E. Mitchell, Michael J. Todd:
Solving combinatorial optimization problems using Karmarkar's algorithm. 245-284 - Yinyu Ye:
On affine scaling algorithms for nonconvex quadratic programming. 285-300 - Paul Tseng, Zhi-Quan Luo:
On the convergence of the affine-scaling algorithm. 301-319 - Claus Wallacher, Uwe T. Zimmermann:
A combinatorial interior point method for network flow problems. 321-335 - Jochen W. Schmidt, Siegfried Dietze:
Unconstrained duals to partially separable constrained programs. 337-341 - János D. Pintér:
Convergence qualification of adaptive partition algorithms in global optimization. 343-360 - Michael C. Ferris
, Andrew B. Philpott
:
On affine scaling and semi-infinite programming. 361-364
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.