default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 28
Volume 28, Number 1, January 1984
- Gerard van der Laan:
On the existence and approximation of zeroes. 1-24 - Andreas Griewank
, Philippe L. Toint:
On the existence of convex decompositions of partially separable functions. 25-49 - Robert Mifflin:
Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization. 50-71 - Jitka Dupacová:
Stability in stochastic programming with recourse-estimated parameters. 72-83 - Rainer Rhode, Reinhard Weber:
The range of the efficient frontier in multiple objective linear programming. 84-95 - Guy Pierra:
Decomposition through formalization in a product space. 96-115 - Takao Fujimoto:
An extension of Tarski's fixed point theorem and its application to isotone complementarity problems. 116-118
Volume 28, Number 2, February 1984
- Peter L. Hammer, Pierre Hansen, Bruno Simeone:
Roof duality, complementation and persistency in quadratic 0-1 optimization. 121-155 - Harold W. Kuhn, Ze-ke Wang, Senlin Xu:
On the cost of computing roots of polynomials. 156-163 - Romesh Saigal:
Computational complexity of a piecewise linear homotopy algorithm. 164-173 - Stella Dafermos, Anna Nagurney:
Sensitivity analysis for the asymmetric network equilibrium problem. 174-184 - Jonathan M. Borwein, J. W. Nieuwenhuis:
Two kinds of normality in vector optimization. 185-191 - Yoshitsugu Yamamoto:
A unifying model based on retraction for fixed point algorithms. 192-197 - Silvano Martello, Paolo Toth:
Worst-case analysis of greedy algorithms for the subset-sum problem. 198-205 - Robert F. Giese, Philip C. Jones:
An economic model of short-rotation forestry. 206-217 - Marshall L. Fisher, Abba M. Krieger:
Analysis of a linearization heuristic for single-machine scheduling to maximize profit. 218-225 - Kim-Lin Chew, Eng Ung Choo:
Pseudolinearity and efficiency. 226-239
Volume 28, Number 3, October 1984
- Thomas F. Coleman, Jorge J. Moré:
Estimation of sparse hessian matrices and graph coloring problems. 243-270 - Richard T. Wong:
A dual ascent approach for steiner tree problems on a directed graph. 271-287 - Masakazu Kojima, Yoshitsugu Yamamoto:
A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm. 288-328 - Shinji Mizuno:
An analysis of the solution set to a homotopy equation between polynomials with real coefficients. 329-336 - Gottfried Tinhofer:
Rational solutions of the graphsack problem. 337-348 - Muhamed Aganagic:
Newton's method for linear complementarity problems. 349-362
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-12-13 19:12 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:
