Country: United States

Found 17049 papers in total
Effects of an afternoon nap on nighttime alertness and performance in long-haul drivers
Effects of an afternoon nap on nighttime alertness and performance in long-haul drivers
2002,
The effects of an afternoon nap on alertness and psychomotor performance were assessed...
Process monitoring strategies for surface mount manufacturing processes
Process monitoring strategies for surface mount manufacturing processes
2003,
Establishing reliable surface mount assemblies requires robust design and assembly...
Constraint and integer programming in OPL (Optimization Programming Language)
Constraint and integer programming in OPL (Optimization Programming Language)
2002,
In recent years, it has been increasingly recognized that constraint and integer...
A stochastic integer program with dual network structure and its application to the ground-holding problem
A stochastic integer program with dual network structure and its application to the ground-holding problem
2003,
In this paper, we analyze a generalization of a classic network-flow model. The...
The role of integer programming techniques in constraint programming's global constraints
The role of integer programming techniques in constraint programming's global constraints
2002,
Efforts aimed at combining operations research and constraint programming have become...
Improving crew scheduling by incorporating key maintenance routing decisions
Improving crew scheduling by incorporating key maintenance routing decisions
2003,
Crew costs are the second-largest operating expense faced by the airline industry,...
Addendum to ‘Presolve analysis of linear programs prior to applying an interior point method’
Addendum to ‘Presolve analysis of linear programs prior to applying an interior point method’
2001,
In this note we point out that the assumptions of Propositions 1 and 2 in Gondzio...
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...
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...
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...
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...
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...
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...
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...
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...
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...
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...
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/∞...
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...
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...
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...
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...
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...
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...
Papers per page: