Country: United States

Found 17049 papers in total
An analysis of the alias method for discrete random-variate generation
An analysis of the alias method for discrete random-variate generation
2005,
This paper introduces and studies an optimization problem related to the alias method...
State-of-the-art review – A user's guide to the brave new world of designing simulation experiments
State-of-the-art review – A user's guide to the brave new world of designing simulation experiments
2005,
Many simulation practitioners can get more from their analyses by using the...
Searching for good multiple recursive random number generators via a genetic algorithm
Searching for good multiple recursive random number generators via a genetic algorithm
2004,
In designing ideal multiple recursive random number (RN) generators (MRGs), the best...
The filtered nearest neighbor method for generating low-discrepancy sequences
The filtered nearest neighbor method for generating low-discrepancy sequences
2004,
We introduce the filtered nearest neighbor method for generating low-discrepancy...
Execution conditions: A formalization of event cancellation in simulation graphs
Execution conditions: A formalization of event cancellation in simulation graphs
2003,
Simulation graph models provide a powerful and general modeling framework for...
Introduction to Rare Event Simulation
Introduction to Rare Event Simulation
2006,
An automated multiresolution procedure for modeling complex arrival processes
An automated multiresolution procedure for modeling complex arrival processes
2006,
To automate the multiresolution procedure of Kuhl et al. for modeling and simulating...
A two-moment approximation for the GI/G/c queue with finite capacity
A two-moment approximation for the GI/G/c queue with finite capacity
2005,
In this paper, we consider the steady-state queue length of the multiserver...
The [Pht/Pht/∞]K queueing system: Part II – The multiclass network
The [Pht/Pht/∞]K queueing system: Part II – The multiclass network
2004,
We demonstrate a numerically exact method for evaluating the time-dependent mean,...
The Pht/Pht/∞ queueing system: Part I – The single node
The Pht/Pht/∞ queueing system: Part I – The single node
2004,
We develop a numerically exact method for evaluating the time-dependent mean,...
Tour merging via branch-decomposition
Tour merging via branch-decomposition
2003,
Robertson and Seymour introduced branch-width as a new connectivity invariant of...
On a new collection of stochastic linear programming test problems
On a new collection of stochastic linear programming test problems
2004,
The purpose of this paper is to introduce a new test-problem collection for stochastic...
Oblique multicategory decision trees using nonlinear programming
Oblique multicategory decision trees using nonlinear programming
2005,
Induction of decision trees is a popular and effective method for solving...
The constraint consensus method for finding approximately feasible points in nonlinear programs
The constraint consensus method for finding approximately feasible points in nonlinear programs
2004,
This paper develops a method for moving quickly and cheaply from an arbitrary initial...
Primal–dual-based algorithms for a directed network design problem
Primal–dual-based algorithms for a directed network design problem
2005,
We present efficient algorithms for a special case of network design problems, the...
A set-covering-based heuristic approach for bin-packing problems
A set-covering-based heuristic approach for bin-packing problems
2006,
Several combinatorial optimization problems can be formulated as large set-covering...
Algorithms for the frame of a finitely generated unbounded polyhedron
Algorithms for the frame of a finitely generated unbounded polyhedron
2006,
Consider two finite sets 𝒜 and 𝒱 of points in m -dimensional space. The...
LPFML: A W3C XML Schema for linear and integer programming
LPFML: A W3C XML Schema for linear and integer programming
2005,
There are numerous modeling systems for generating linear programs and numerous...
A column-generation approach to the multiple knapsack problem with color constraints
A column-generation approach to the multiple knapsack problem with color constraints
2006,
In this paper, we study a new problem that we refer to as the multiple knapsack with...
The analytic-center cutting-plane method for variational inequalities: A quadratic-cut approach
The analytic-center cutting-plane method for variational inequalities: A quadratic-cut approach
2005,
We introduce a cutting-plane, analytic-center algorithm for strongly monotone...
A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
2005,
We consider an extension of the 0–1 multidimensional knapsack problem in which...
On bridging the gap between stochastic integer programming and MIP solver technologies
On bridging the gap between stochastic integer programming and MIP solver technologies
2004,
Stochastic integer programs (SIPs) represent a very difficult class of optimization...
Generating cutting planes for mixed integer programming problems in a parallel computing environment
Generating cutting planes for mixed integer programming problems in a parallel computing environment
2004,
A parallel implementation of a disjunctive cutting-plane algorithm in a distributed...
K-cuts: A variation of Gomory mixed integer cuts from the LP tableau
K-cuts: A variation of Gomory mixed integer cuts from the LP tableau
2003,
For an integer program, a k -cut is a cutting plane generated by the Gomory mixed...
Papers per page: