Country: United States

Found 17049 papers in total
Calculating the distribution of a linear combination of uniform order statistics
Calculating the distribution of a linear combination of uniform order statistics
2002,
The calculation of the distribution of a linear combination of order statistics from...
Empirical Bayes estimates in exponential reliability model
Empirical Bayes estimates in exponential reliability model
2003,
This paper is devoted to the estimation of the reliability measures in an exponential...
Optimization for simulation: Theory vs. Practice
Optimization for simulation: Theory vs. Practice
2002,
Probably one of the most successful interfaces between operations research and...
Ranking and selection for steady-state simulation: Procedures and perspectives
Ranking and selection for steady-state simulation: Procedures and perspectives
2002,
We present and evaluate three ranking-and-selection procedures for use in steady-state...
Convergence properties of the batch means method for simulation output analysis
Convergence properties of the batch means method for simulation output analysis
2001,
We examine key convergence properties of the steady-state simulation analysis method...
Properties of batched quadratic-form variance parameter estimators for simulations
Properties of batched quadratic-form variance parameter estimators for simulations
2001,
We examine the practice of batching of certain quadratic-form estimators for the...
Fatou's lemma for multifunctions with unbounded values
Fatou's lemma for multifunctions with unbounded values
1995,
For multifunctions having unbounded sets as values we give Fatou-type inclusions for...
Affine-scaling trajectories associated with a semi-infinite linear program
Affine-scaling trajectories associated with a semi-infinite linear program
1995,
Semi-infinite linear programs often arise as the limit of a sequence of approximating...
Strong approximations for time-dependent queues
Strong approximations for time-dependent queues
1995,
A time-dependent M(t)/M(t)/1 queue alternates through periods of under-, over-, and...
Symbolic computation of moments in priority queues
Symbolic computation of moments in priority queues
2002,
Analytical tools such as Laplace–Stieltjes transforms and z-transforms are...
Phantom harmonic gradient estimators for nonpreemptive priority queueing systems
Phantom harmonic gradient estimators for nonpreemptive priority queueing systems
2001,
This paper presents a new gradient estimator for the steady-state expected sojourn...
Modeling and analysis of discrete-time multiserver queues with batch arrivals: GIX/Geom/m.
Modeling and analysis of discrete-time multiserver queues with batch arrivals: GIX/Geom/m.
2001,
Multiserver queues are often encountered in telecommunications systems and have...
New transient solution to the M/M infinity queue with varying arrival and departure rate
New transient solution to the M/M infinity queue with varying arrival and departure rate
2003,
The objective of this paper is to derive the transient solution for infinite server...
A new formula for the transient behaviour of a non-empty M/M/1/∞ queue
A new formula for the transient behaviour of a non-empty M/M/1/∞ queue
2002,
This paper studies the most general model of the Markovian queues namely M/M/1/∞...
A hybrid exact algorithm for the Travelling Salesman Problem with Time Windows
A hybrid exact algorithm for the Travelling Salesman Problem with Time Windows
2002,
The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a...
The online travelling salesman problem against fair adversaries
The online travelling salesman problem against fair adversaries
2001,
In the online traveling salesman problem, requests for visits to cities (points in a...
Linear time dynamic-programming algorithms for new classes of restricted travelling salesman problems: a computational study
Linear time dynamic-programming algorithms for new classes of restricted travelling salesman problems: a computational study
2001,
Consider the following restricted (symmetric or asymmetric) traveling-salesman problem...
Capacitated network design with uncertain demand
Capacitated network design with uncertain demand
2002,
We consider a capacity-expansion problem arising in the design of telecommunication...
The path restoration version of the spare capaciity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
The path restoration version of the spare capaciity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
2001,
This investigation presents a strategy to construct a compact mathematical model of...
A surface of analytic centers and primal–dual infeasible-interior-point algorithms for linear-programming
A surface of analytic centers and primal–dual infeasible-interior-point algorithms for linear-programming
1995,
We define a surface of analytic centers determined by a primal–dual pair of...
On the complexity of a class of projective interior-point methods
On the complexity of a class of projective interior-point methods
1995,
We present a generic projective interior-point algorithm for linear programming which...
The semismooth algorithm for large scale complementarity problems
The semismooth algorithm for large scale complementarity problems
2001,
Complementarity solvers are continually being challenged by modelers demanding...
Fast heuristics for the maximum feasible subsystem problem
Fast heuristics for the maximum feasible subsystem problem
2001,
Given an infeasible set of linear constraints, finding the maximum cardinality...
A parallel, linear programming-based heuristic for large-scale set partitioning problems
A parallel, linear programming-based heuristic for large-scale set partitioning problems
2001,
We describe a parallel, linear programming and implication-based heuristic for solving...
Papers per page: