![](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 68
Volume 68, 1995
- Peter Kleinschmidt, Heinz Schannath:
A strongly polynomial algorithm for the transportation problem. 1-13 - J. Frédéric Bonnans, Jean Charles Gilbert
, Claude Lemaréchal, Claudia A. Sagastizábal
:
A family of variable metric proximal methods. 15-47 - Gongyun Zhao:
On the choice of parameters for power-series interior point algorithms in linear programming. 49-71 - Alberto Marchetti-Spaccamela
, Carlo Vercellis:
Stochastic on-line knapsack problems. 73-104 - Jirí V. Outrata, Jochem Zowe:
A numerical approach to optimization problems with variational inequality constraints. 105-130 - Sung-Pil Hong, Sushil Verma:
A note on the strong polynomiality of convex quadratic programming. 131-139 - Richard A. Tapia, Yin Zhang, Yinyu Ye:
On the convergence of the iteration sequence in primal-dual interior-point methods. 141-154 - E. Andrew Boyd:
Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent. 155-168 - Wieslawa T. Obuchowska, Richard J. Caron
:
Minimal representation of quadratically constrained convex feasible regions. 169-186 - G. S. R. Murthy, T. Parthasarathy, G. Ravindran:
On co-positive, semi-monotone Q-matrices. 187-203 - Pascual Ruíz-Canales
, Antonio Rufián-Lizana
:
A characterization of weakly efficient points. 205-212 - Daniel Bienstock, Oktay Günlük
:
Computational experience with a difficult mixed-integer multicommodity flow problem. 213-237 - Egon Balas, Matteo Fischetti, William R. Pulleyblank:
The precedence-constrained asymmetric traveling salesman polytope. 241-265 - José Mario Martínez
, Sandra Augusta Santos
:
A trust-region strategy for minimization on arbitrary domains. 267-301 - Yin Zhang, Detong Zhang:
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms. 303-318 - John E. Dennis Jr., Shou-Bai B. Li, Richard A. Tapia:
A unified approach to global convergence of trust region methods for nonsmooth optimization. 319-346
![](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.