Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 33
Volume 33, Number 1, September 1985
- Gérard Cornuéjols, Jean Fonlupt, Denis Naddef:
The traveling salesman problem on a graph and some related integer polyhedra. 1-27 - Martin Grötschel, Michael Jünger, Gerhard Reinelt:
On the acyclic subgraph polytope. 28-42 - Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Facets of the linear ordering polytope. 43-60 - David F. Shanno:
Globally convergent conjugate gradient algorithms. 61-67 - Peter J. M. van Laarhoven:
Parallel variable metric algorithms for unconstrained optimization. 68-81 - Odile Marcotte:
The cutting stock problem and integer rounding. 82-92 - Freerk A. Lootsma:
Performance evaluation of nonlinear optimization methods via pairwise comparison and fuzzy numbers. 93-114 - P. Dombi
:
On extremal points of quasiconvex functions. 115-119
Volume 33, Number 2, November 1985
- Yoshiro Ikura, George L. Nemhauser:
Simplex pivots on the set packing polytope. 123-138 - Robert M. Freund, James B. Orlin:
On the complexity of four polyhedral set containment problems. 139-145 - Kenneth O. Kortanek, H. M. Strojwas:
On constraint sets of infinite linear programs over ordered fields. 146-161 - Jonathan Goodman:
Newton's method for constrained optimization. 162-171 - Philip E. Gill, Walter Murray, Michael A. Saunders, G. W. Stewart, Margaret H. Wright:
Properties of a representation of a basis for the null space. 172-186 - Donald Goldfarb:
Efficient dual simplex algorithms for the assignment problem. 187-203 - Robert Fourer:
A simplex algorithm for piecewise-linear programming I: Derivation and proof. 204-233 - Arthur Warburton:
Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems. 234-241
Volume 33, Number 3, December 1985
- Martin Grötschel, Olaf Holland:
Solving matching problems with linear programming. 243-259 - James V. Burke:
Descent methods for composite nondifferentiable optimization problems. 260-279 - Alexander Shapiro:
Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs. 280-299 - Helmut Ratschek:
Inclusion functions and global optimization. 300-317 - Hannu Väliaho:
A unified approach to one-parametric general quadratic programming. 318-338 - Patrice Marcotte:
A new algorithm for solving variational inequalities with application to the traffic assignment problem. 339-351 - Kazimierz Malanowski:
Differentiability with respect to parameters of solutions to convex programming problems. 352-361
a service of 
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-05-10 19:50 CEST 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:
