Journal: Operations Research Letters

Found 1763 papers in total
A new index of component importance
2001,
Several indices of component importance have been proposed in the literature. The...
Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
2001,
We formulate the problem of optimizing a convex function over the weakly efficient set...
A trust region algorithm for nonlinear bilevel programming
2001,
We propose to solve generalized bilevel programs by a trust region approach where the...
On the Slater condition for the semidefinite programming relaxations of nonconvex sets
2001,
We prove that all results determining the dimension and the affine hull of feasible...
An interactive interior point algorithm for multiobjective linear programming problems
2001,
We propose an interactive interior point method for finding the best compromise...
Approximations and bounds for the variance of steady-state waiting times in a GI/G/1 queue
2001,
The focus of this paper is on developing bounds for the variance of steady-state...
Approximations for the waiting time distribution in polling models with and without state-dependent setups
2001,
A polling model is a queueing model where many job classes share a single server and a...
On the transient analysis of the MX/M/∞ queue
2001,
In this note, it is demonstrated using generating function or level crossing arguments...
Extending Graham's result on scheduling to other heuristics
2001,
This paper considers the off-line scheduling problem where a list of jobs must be...
A comment on multi-stage data envelopment analysis methodology
2001,
Coelli introduced a multi-stage (MS-) DEA methodology that represents an interesting...
Point availability of a robot-safety device
2001,
We consider a robot-safety device system attended by two repairmen. In order to derive...
Some results on successive failure times of a system with minimal instantaneous repairs
2001,
This paper considers a system with minimal instantaneous repairs which is almost...
Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model
2001,
Minimizing average ordering and holding cost subject to a constraint on expected...
An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
2001,
We consider the maximization version of the two level uncapacitated facility location...
Structure importance of consecutive-k-out-of-n systems
1999,
A consecutive- k -out-of- n : F system is an n -component system that fails when k...
Assessment of several algorithms for multi-period market equilibrium models with geometric distributed lag demand
2001,
With distributed lags, demand is a function of prices in the current and earlier...
A reverse search algorithm for the neighborhood problem
1999,
We describe an algorithm for the solution of the neighborhood problem and of a closely...
Notes on polyhedra associated with hop-constrained paths
1999,
We study the dominant of the convex hull of st -paths with at most k edges in a graph....
Exact solution of multicommodity network optimization problems with general step cost functions
1999,
We describe an exact solution procedure, based on the use of standard LP software, for...
Optimal on-line algorithms for variable-sized bin covering
1999,
We deal with the variable-sized bin covering problem: Given a list L of items in (0,1]...
Zero duality gap in integer programming: P-norm surrogate constraint method
1999,
A p -norm surrogate constraint method is proposed for integer programming. A single...
Robust solutions of uncertain linear programs
1999,
We treat in this paper linear programming (LP) problems with uncertain data. The focus...
Steplengths in interior-point algorithms of quadratic programming
1999,
An approach to determine primal and dual stepsizes in the infeasible-interior-point...
Explicit M/G/1 waiting-time distributions for a class of long-tail service-time distributions
1999,
O.J. Boxma and J.W. Cohen recently obtained an explicit expression for the M/G/1...
Papers per page: