Country: United States

Found 17049 papers in total
The square-wave spectral density of a stationary renewal process
The square-wave spectral density of a stationary renewal process
1989,
The power spectral density of a random square wave is a promising tool in the...
Markov chains with quasitoeplitz transition matrix: First zero hitting
Markov chains with quasitoeplitz transition matrix: First zero hitting
1989,
This paper continues the investigation of Markov chains with a quasitoeplitz...
Polynomial goal programming: A procedure for modeling preference trade-offs
Polynomial goal programming: A procedure for modeling preference trade-offs
1988,
This paper develops an approach for a generalized goal programming model and solution...
Characterization of phase-type distributions
Characterization of phase-type distributions
1990,
A distribution with rational Laplace-Stieltjes transform is of phase type if and only...
Phase-type representations for matrix-geometric solutions
Phase-type representations for matrix-geometric solutions
1990,
This note re-examines the structured Markov chain { X k ,N k ;k=0,1,...} studied by...
An analysis of six greedy selection rules on a class of zero-one integer programming models
An analysis of six greedy selection rules on a class of zero-one integer programming models
1990,
Six greedy primal selection rules are evaluated on a class of generalized set packing...
A Markov renewal approach to the Poisson disorder problem
A Markov renewal approach to the Poisson disorder problem
1990,
In the Poisson disorder problem, a decision maker observes a Poisson process whose...
A relaxation/decomposition algorithm for the fixed charged network problem
A relaxation/decomposition algorithm for the fixed charged network problem
1990,
This article makes use of relaxation in conjunction with decomposition for the...
A branch-and-fathom algorithm for the long range process design problem
A branch-and-fathom algorithm for the long range process design problem
1990,
Several problems, including the long-range process design problem, have been...
An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
1990,
Although there has been extensive research on interactive multiple objective decision...
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
1990,
Recent developments in deterministic global optimization methods have considerably...
An algorithm for concave integer minimization over a polyhedron
An algorithm for concave integer minimization over a polyhedron
1990,
The authors present an algorithm for solving the problem of globally minimizing a...
An algorithm for quadratic zero-one programs
An algorithm for quadratic zero-one programs
1990,
The authors present an algorithm for the quadratic zero-one minimization by...
A simulated annealing approach to scheduling a manufacturing cell
A simulated annealing approach to scheduling a manufacturing cell
1990,
This article proposes a new heuristic based on simulated annealing that schedules part...
Sharp conditions for the oscillation of delay difference equations
Sharp conditions for the oscillation of delay difference equations
1989,
Suppose that { p n } is a nonnegative sequence of real numbers and let k be a positive...
A sharp upper bound for discrete inequalities of Gronwall-Bellman type
A sharp upper bound for discrete inequalities of Gronwall-Bellman type
1989,
A sharp upper bound is given for solutions of a discrete inequality of the...
A Bard-type method for a generalized linear complementarity problem with a nonsingular M-matrix
A Bard-type method for a generalized linear complementarity problem with a nonsingular M-matrix
1990,
In this article the authors develop an extension of Murty’s Bard-type method for...
Formulating processing network models: Viability theory
Formulating processing network models: Viability theory
1990,
A processing network contains at least one processing node; such a node is constrained...
An interactive MCDM weight space reduction method utilizing a Tchebycheff utility function
An interactive MCDM weight space reduction method utilizing a Tchebycheff utility function
1990,
Employing a Tchebycheff utility function to locally approximate the underlying utility...
Large level crossings of a random polynomial
Large level crossings of a random polynomial
1988,
We know the expected number of times that a polynomial of degree n with independent...
Guaranteed •-approximate solution for indefinite quadratic global minimization
Guaranteed •-approximate solution for indefinite quadratic global minimization
1990,
The global minimization of large-scale indefinite quadratic problems over a bounded...
An assignment problem with queueing time cost
An assignment problem with queueing time cost
1990,
In this article the authors study the problem of assigning customers to service...
Multiple finite source queueing model with dynamic priority scheduling
Multiple finite source queueing model with dynamic priority scheduling
1990,
This article involves the study of a multiple finite source queueing model with a...
One-dependent regenerative processes and queues in continuous time
One-dependent regenerative processes and queues in continuous time
1990,
Motivated by the study of queues in continuous time, a ‘one-dependent’...
Papers per page: