Volume 11, Number 1, 1984
Volume 11, Number 2, 1984
Olvi L. Mangasarian:
Sparsity-preserving sor algorithms for separable quadratic and linear programming.
105-112
Lakshman S. Thakur:
Solving highly nonlinear convex separable programs using successive approximation.
113-128
John J. Dinkel,
Danny Wong:
Application of sensitivity analysis to the optimization of petroleum drilling operations.
129-140
Kose John:
Parametric fixed point algorithms with applications to economic policy analysis.
157-178
Volume 11, Number 3, 1984
Moshe F. Friedman:
Balancing stocks and backlogs with stochastic lead times : A special case.
233-239
Moshe F. Friedman:
On some optimality conditions and their equivalence in time-dependent inventory models.
245-251
Igal Adiri,
Neta Amit:
Openshop and flowshop scheduling to minimize sum of completion times.
275-284
Reuven Chen:
Location problems with costs being sums of powers of euclidean distances.
285-294
R. Michael Harnett:
A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints.
321-331
Les G. Proll:
An improved formulation of the pwr core management model.
345-347
Volume 11, Number 4, 1984
Herwig Bruneel:
Analysis of an infinite buffer system with random server interruptions, .
373-386
H. P. Williams:
Restricted vertex generation applied as a CRASHing procedure for linear programming.
401-407
Pamela K. Coats:
Electronic funds transfer networks: Modeling their impact on bank service goals.
415-426
data released under the ODC-BY 1.0 license
