Found 97029 papers in total
Simulated Annealing: A tool for Operational Research
1990,
This paper describes the Simulated Annealing algorithm and the physical analogy on which it is based. Some...
Reading data in a hierarchical memory
1991,
In 1987 A Aggarwal, A.K. Chandra and M. Snir developed a model of hierarchical memory with block transfer....
Preuniquely k-colourable graphs and k-colouring matrices
1991,
A non-uniquely k -colourable graph G is said to be preuniquely k -colourable if the addition of any edge...
On relational database schemes having unique minimal key
1991,
The relational database schemes having unique minimal key are completely characterized. The relationships...
On duality for Boolean programming
1990,
A short review of duality in connection with Boolean programming is given. The linear, quadratic and...
Optimal monotone hysteretic Markov policies in an M/M/1 queueing model with switching costs and finite time horizon
1991,
In an M/M/1 queueing model, a decision maker can choose m pairs of arrival- and service rates. He can...
‘Stop-recirculate’ for exponential product form queueing networks with departure blocking
1991,
The steady-state queue-size distribution of Jacksonian queueing networks with departure blocking is shown...
Modelling a Telecommunication Common Channel Signalling Network
1991,
The design and implementation of a computer package which helps design telecommunications networks is...
On Time Petri nets
1991,
This paper shows how to study boundedness and liveness of a finite Time Petri net in a discrete way by...
Reliability bounds based on network splitting
1991,
The K -terminal reliability is the probability that all K -vertices in a stochastic network are connected....
A note on the paper ‘Characterization of all optimal solutions and parametric maximal flows in networks’ of G. Ruhe
1991,
First it is shown that the implementation of the algorithm proposed in the considered paper may cause some...
A factoring approach for the stochastic shortest path problem
1991,
This paper studies the problem of determining the exact distribution of shortest path length in directed...
Exact auxiliary functions in optimization problems
1990,
The concept of an exact auxiliary function such that the problem of minimizing it has the same set of...
The use of local coordinates in optimization problems
1990,
The necessary and sufficient conditions for an extremum are expressed in local coordinates. It is shown...
An analytical approach to global optimization
1991,
Global optimization problems with a few variables and constraints arise in numerous applications but are...
Optimal simplification of cartographic lines using shortest-path formulations
1991,
Line simplification is a process by which unnecessary detail in cartographic data is eliminated. In the...
The growth of m-constraint random knapsacks
1990,
The author computes the asymptotic value of a particular m -constraint, n -variable 0-1 random integer...
Determining the control limit policy in a replacement model with linear restoration
1991,
The authors consider a replacement model for an additive damage process with linear restoration as...
On the convergence of Han’s method for convex programming with quadratic objective
1991,
The authors present an iterative method for minimizing strictly convex quadratic functions over the...
-dualities and -dualities
1991,
The authors introduce and study dualities (i.e., mappings such that for all and all index sets I ), which...
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
1991,
This paper presents new versions of proximal bundle methods for solving convex constrained...
Solving nonsmooth inclusions in the convex case
1991,
The authors give a method for solving the inclusion 0∈F(x) , where F is a set-valued map from a...
Application of the dynamic programming method to standardization problems
1990,
A computation scheme of the dynamic-programming method is described for a special class of multiextremum...
An improved discrete dynamic programming algorithm for allocating resources among interdependent projects
1991,
Nemhauser and Ullmann proposed a discrete dynamic programming (DP) approach for several variations of the...
Papers per page:

Paper Filter