


default search action
Mathematical Programming, Volume 55
Volume 55, 1992
- Michael J. Todd:

On Anstreicher's combined phase I-phase II projective algorithm for linear programming. 1-15 - Joseph F. Pekny, Donald L. Miller:

A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. 17-33 - Michele Conforti, M. R. Rao:

Properties of balanced and perfect matrices. 35-47 - Gianni Di Pillo

, Francisco Facchinei
, Luigi Grippo:
An RQP algorithm using a differentiable exact penalty function for inequality constrained problems. 49-68 - José H. Dulá:

An upper bound on the expectation of simplicial functions of multivariate random variables. 69-80 - Ury Passy, Eliezer Z. Prisman

:
A duality approach to minimax results for quasi-saddle functions in finite dimensions. 81-98 - A. G. Robinson, N. Jiang, C. S. Lerme:

On the continuous quadratic knapsack problem. 99-108 - Yin Zhang:

Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization. 109-124 - Michele Conforti, M. R. Rao:

Structural properties and decomposition of linear balanced matrices. 129-168 - Martin E. Dyer

, Alan M. Frieze
:
Probabilistic analysis of the generalised assignment problem. 169-181 - Ephraim Korach, Michal Penn:

Tight integral duality gap in the Chinese Postman problem. 183-191 - Alan J. King, R. Tyrrell Rockafellar

:
Sensitivity analysis for nonsmooth generalized equations. 193-212 - Rachelle S. Klein, Hanan Luss, Donald R. Smith:

A lexicographic minimax algorithm for multiperiod resource allocation. 213-234 - Asim Roy, Jyrki Wallenius:

Nonlinear multiple objective optimization: An algorithm and some theory. 235-249 - Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu:

Global optimization of univariate Lipschitz functions: I. Survey and properties. 251-272 - Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu:

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison. 273-292 - Jonathan Eckstein

, Dimitri P. Bertsekas:
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. 293-318 - Graham R. Wood:

The bisection method in higher dimensions. 319-337 - Martin Grötschel, Zaw Win:

A cutting plane algorithm for the windy postman problem. 339-358 - Dorit S. Hochbaum, Ron Shamir

, J. George Shanthikumar:
A polynomial algorithm for an integer quadratic non-separable transportation problem. 359-371

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














