Found 97029 papers in total
Data error analysis in unconstrained optimization problems with the CESTAC method
1988,
The CESTAC method-also known as the Permutation-Perturbation method-was first conceived to analyse the...
Analysis of rounding errors in large systems of nonlinear equations
1988,
The behavior of rounding errors in computing complicated functions is analysed and the adequacy of the...
Random search algorithms with sufficient descent for minimization of functions
1989,
A random search method for function minimization is presented. At each point it randomly searches for the...
On the convergence of one-dimensional simplex search
1989,
This paper, first gives a counterexample showing the falsehood of the convergence theorem of Choo and Kim...
Assessing process capability: A Bayesian approach
1989,
Quality Control Practitioners often base inferences regarding the capability of a process on a point...
Closed form two-sided bounds for probabilities that at least r and exactly r out of n events occur
1989,
In two previous papers Prékopa gave algorithms to approximate probabilities that at least r and...
The ‘largest element first’ heuristic for the maximization assignment problem
1989,
A heuristic for the maximization assignment problem is presented. Results are given for the worst case and...
Pure adaptive search in Monte Carlo optimization
1989,
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence...
The projective SUMT method for convex programming
1989,
An algorithm for solving convex programming problems is derived from the differential equation...
A decomposition method and its application to convex programming
1989,
A method is proposed for minimizing a function of the form q ( x - d )+ f 1 ( x...
A classified bibliography of research on stochastic PERT networks: 1966-1987
1989,
The aim of this paper is to present a classified bibliography of research work on stochastic PERT networks...
Degeneracy in infinite horizon optimization
1989,
The authors consider sequential decision problems over an infinite horizon. The forecast or solution...
Adaptive aggregation methods for infinite horizon dynamic programming
1989,
The authors propose a class of iterative aggregation algorithms for solving infinite horizon dynamic...
Dynamic programming by exchangeability
1989,
This article introduces the concept of exchangeable stopping time and a technique of dynamic programming...
Productivity modeling of group machine loading with variable processing times
1989,
This paper describes a procedure for optimizing the Total Productivity (TP) in a manufacturing process...
Analysis of a class of fractional programming problems
1989,
The paper proposes a solution strategy for fractional programming problems of the form max x Å∈...
Convergence of interval-type algorithms for generalized fractional programming
1989,
The purpose of this paper is to analyze the convergence of interval-type algorithms for solving the...
Quadratically constrained minimum cross-entropy analysis
1989,
Quadratically constrained minimum cross-entropy problem has recently been studied by Zhang and Brockett...
Optima of dual integer programs
1988,
The authors consider dual pairs of packing and covering integer linear programs. Best possible bounds are...
Implicit treatment of ‘zero or range’ constraints in a model for minimum cost foundry alloys
1989,
A major problem in foundries is to select scrap alloys and pure metals in order to produce at minimum cost...
Boltzmann machines for travelling salesman problems
1989,
Boltzmann machines are proposed as a massively parallel alternative to the (sequential) simulated...
Constrained spanning trees and the traveling salesman problem
1989,
Minimum weight 1-trees provide a well-known lower bound for the symmetric traveling salesman problem. The...
A Lagrangean approach to the degree-constrained minimum spanning tree problem
1989,
A known branch and bound algorithm for the degree-constrained minimum spanning tree problem is adapted for...
Marginal values in mixed integer programming
1989,
For a given optimization problem, P, considered as a function of the data, its marginal values are defined...
Papers per page:

Paper Filter