Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Operations Research Letters
Found
1763 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
An interior point method for solving systems of linear equations and inequalities
2000,
Salo Seppo
A simple interior point method is proposed for solving a system of linear equations...
A comment on multi-stage data envelopment analysis methodology
2001,
Cherchye Laurens
Coelli introduced a multi-stage (MS-) DEA methodology that represents an interesting...
Constrained Markovian decision processes: the dynamic programming approach
2000,
Piunovskiy A.B.
We consider semicontinuous controlled Markov models in discrete time with total...
Inventory system for goods with censored random lifetimes
2000,
Perry David
We consider a Poisson inventory model for perishable goods in which the items have...
Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
2001,
Muu Le D.
We formulate the problem of optimizing a convex function over the weakly efficient set...
Recursive approximation of the high dimensional max function
2005,
Zhang S.
This paper proposes a smoothing method for the general n -dimensional max function,...
Average fill rate and horizon length
2005,
Paul Anand
Given a sequence of independent and identically distributed demands and an order up to...
Approximating separable nonlinear functions via mixed zero–one programs
2000,
Padberg Manfred
We discuss two models from the literature that have been developed to formulate...
On optimal exhaustive policies for the M/G/1-queue
2000,
Lillo R.E.
Given an M/G/1 queue controlled by an exhaustive policy 𝒫, we consider a (𝒫...
Tandem fluid queues fed by homogeneous on–off sources
2000,
Aalto Samuli
We consider a tandem fluid model with multiple consecutive buffers. The input of...
Approximations and bounds for the variance of steady-state waiting times in a GI/G/1 queue
2001,
Feldman Richard M.
The focus of this paper is on developing bounds for the variance of steady-state...
Heavy-traffic asymptotics for the single-server queue with random order of service
2005,
Zwart Bert
We consider the GI/G/1 queue with customers served in random order, and derive the...
M/G/1/MLPS compared to M/G/1/PS
2005,
Aalto Samuli
Multilevel processor sharing scheduling disciplines have recently been resurrected in...
An expectation maximization (EM) algorithm for platoon arrival processes in discrete time
2005,
Alfa Attahiru Sule
The platoon arrival process (PAP), a special case of Markovian arrival process (MAP),...
A Sokhotski–Plemelj problem related to a robot-safety device system
2000,
Vanderperre E.J.
We introduce a robot-safety device system attended by two different repairmen. The...
On deviation measures in stochastic integer programming
2005,
Schultz Rdiger
We propose extensions of traditional expectation-based stochastic integer programs to...
Reduced-load equivalence for Gaussian processes
2005,
Borst Sem
We consider a fluid model fed by two Gaussian processes. We obtain necessary and...
Control limit policies in a replacement model with additive phase-type distributed damage and linear restoration
2000,
Perry David
We consider a replacement model for an additive damage process with linear...
A 3-approximation algorithm for two-dimensional bin packing
2005,
Zhang Guochuan
In the classical two-dimensional bin packing problem one is asked to pack a set of...
A note on the asymptotic behaviour of bottleneck problems
2005,
Albrecher Hansjrg
We generalize and sharpen results of Burkard and Fincke concerning the asymptotic...
Comparison of probability measures: Dominance of the third degree
2000,
Thorlund-Petersen Lars
This note provides necessary and sufficient conditions for third-degree stochastic...
Minimax regret strategies for greenhouse gas abatement: methodology and application
1999,
Loulou Richard
Classical stochastic programming has already been used with large-scale LP models for...
The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges
2000,
Teunter Ruud H.
The problem studied in this paper is that of finding the maximum number of Hamiltonian...
On the k-cut problem
2000,
Barahona Francisco
Given a graph with nonnegative edge-weights, let f(k) be the value of an optimal...
First Page
25
26
27
28
29
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers