Found 97029 papers in total
Replacement process decomposition for discounted Markov renewal programming
1991,
An iterative decomposition method is presented for computing the values in an infinite-horizon discounted...
Cut-threshold graphs
1991,
The authors study the structure of the networks in which connectedness and disconnectedness can be...
The continuous center set of a network
1991,
The continuous radius of a network N is the minimum for all points of N (i.e., vertices or points on...
Uniqueness of currents in infinite resistive networks
1991,
If an infinite resistive network, whose edges have resistance 1ohm, satisfies a certain graph theoretical...
Some numerical experiments with variable-storage quasi-Newton algorithms
1989,
This paper describes some numerical experiments with variable-storage quasi-Newton methods for the...
Block truncated-Newton methods for parallel optimization
1989,
Truncated-Newton methods are a class of optimization methods suitable for large scale problems. At each...
A tolerant algorithm for linearly constrained optimization calculations
1989,
Two extreme techniques when choosing a search direction in a linearly constrained optimization calculation...
Convergence of algorithms for perturbed optimization problems
1990,
Infinite-dimensional optimization problems occur in various applications such as optimal control problems...
Block-scaling of value-iteration for discounted Markov renewal programming
1991,
The functional equations of infinite horizon discounted Markov renewal programming are where T is a...
Perturbed variations of penalty function methods-Example: Projective SUMT
1990,
Penalty function techniques are well known perturbation methods for solving mathematical programming...
Simulated annealing for the permutation flowshop problem
1991,
This paper considers two recently published simulated annealing approaches to flowshop problems, and...
Facets of the Asymmetric Traveling Salesman polytope
1991,
This paper considers the Asymmetric Traveling Salesman polytope, , defined as the convex hull of the...
Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem
1991,
The authors analyze probabilistically the classical Held-Karp lower bound derived from the 1-tree...
Probability density functions of task-processing times for deterministic, time-varying processor efficiency
1990,
The authors consider a task being performed in an environment in which the work-rate (or efficiency of the...
An improvement to Kamerud’s mortality-risk and life-expectancy model
1990,
Every life faces a certain age-specific mortality risk. Changing this mortality risk for a life aged A by...
The adequacy of universal strategies in analytic gambling problems
1991,
Suppose measurability structures are imposed upon a Dubins and Savage gambling problem. A long-standing...
The D1-triangulation of Rn for simplicial algorithms for computing solutions of nonlinear equations
1991,
The paper presents a new triangulation of ℝ n , which is called the D 1 -triangulation, for computing...
A hybrid algorithm for the generalized assignment problem
1991,
A hybrid algorithm for the generalized assignment problem is presented. The algorithm is based on the...
Reducing separable convex programs with tree constraints
1990,
This paper describes a class of separable convex programs with tree constraints that has applications in...
Some topological questions connected with strictly convex functions
1991,
On the basis of a given differentiable strictly convex function F(x) in Euclidean space E n (n≥2)...
Simulation of stochastic activity networks using path control variates
1991,
This article details several procedures for using path control variates to improve the accuracy of...
Risk criteria in a stochastic knapsack problem
1990,
The paper considers an investor who wants to allocate funds among several projects. Each project is...
Myopic solutions of affine dynamic models
1990,
New sufficient conditions are presented for a dynamic process to have a myopic optimum and for a...
Look-ahead policies for admission to a single server loss system
1990,
Consider a single server loss system in which the server, being idle, may reject or accept an arriving...
Papers per page:

Paper Filter