Journal: Operations Research Letters

Found 1763 papers in total
A note on the Pivot and Complement heuristic for 0-1 programming problems
A note on the Pivot and Complement heuristic for 0-1 programming problems
1989,
When solving large scale integer and mixed integer programming problems it is very...
A probabilistic heuristic for a computational difficult set covering problem
A probabilistic heuristic for a computational difficult set covering problem
1989,
An efficient probabilistic set covering heuristic is presented. The heuristic is...
A note on the traveling salesman problem
A note on the traveling salesman problem
1989,
The paper observes that (i) the problem of recognizing instances of the traveling...
The linear multiple choice knapsack problem
The linear multiple choice knapsack problem
1989,
The multiple choice knapsack problem is defined as a knapsack problem with additional...
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem
1989,
Computational results are presented for a parallel branch and bound algorithm that...
Device utilizations in approximate MVA
Device utilizations in approximate MVA
1989,
Using a specific form of the estimate for queueing delays at FCFS servers, it is shown...
Heterogeneous-server loss systems with ordered entry: An anomaly
Heterogeneous-server loss systems with ordered entry: An anomaly
1989,
The authors consider a loss system with Poisson arrivals and ordered entry, and they...
Probing through the intersection of hyperplanes
Probing through the intersection of hyperplanes
1989,
A variant of probe is suggested, by which, using a point infeasible to a linear...
A method of confidence interval construction for simulation output analysis
A method of confidence interval construction for simulation output analysis
1989,
A partial variance procedure for constructing confidence intervals (c.i.) for the mean...
Lagrangian dual ascent by generalized linear programming
Lagrangian dual ascent by generalized linear programming
1989,
In this paper, generalized linear progamming (GLP) is treated as a generator of...
Efficient algorithm for additive and multiplicative models in data envelopment analysis
Efficient algorithm for additive and multiplicative models in data envelopment analysis
1989,
An efficient algorithm is proposed for the additive and multiplicative models in data...
On a cardinality constrained linear programming knapsack problem
On a cardinality constrained linear programming knapsack problem
1989,
The paper presents an O( n 2 ) method for solving the cardinality constrained linear...
Capital gains taxation and the lock-in effect: A probabilistic framework
Capital gains taxation and the lock-in effect: A probabilistic framework
1989,
The purpose of this study is to investigate and compare, from a theoretical point of...
A note on maximal mean/standard deviation ratio in an undiscounted MDP
A note on maximal mean/standard deviation ratio in an undiscounted MDP
1989,
A stationary policy in an MDP (Markov decision process) induces a stationary...
Worst-case analysis of an approximation algorithm for flow-shop scheduling
Worst-case analysis of an approximation algorithm for flow-shop scheduling
1989,
A worst-case analysis of an algorithm proposed by Campbell et al. for the m- machine...
Expected performance of the shelf heuristic for 2-dimensional packing
Expected performance of the shelf heuristic for 2-dimensional packing
1989,
The shelf heuristic is an on-line algorithm to pack oriented rectangles into an...
Multidimensional on-line bin packing: Algorithms and worst-case analysis
Multidimensional on-line bin packing: Algorithms and worst-case analysis
1989,
The authors consider the problem of packing rectangles into bins which are unit...
A note on Barlow-Wu structure functions
A note on Barlow-Wu structure functions
1989,
The essential feature of the class of Barlow-Wu continuum structure functions is...
Cost of sequential connection for points in space
Cost of sequential connection for points in space
1989,
A bound is given for the cost of the spanning tree produced by the sequential minimal...
A decomposition method for minimizing quadratic pseudo-Boolean functions
A decomposition method for minimizing quadratic pseudo-Boolean functions
1989,
A decomposition method is proposed for minimizing quadratic pseudo-Boolean functions....
Computational complexity of uncapacitated multi-echelon production planning problems
Computational complexity of uncapacitated multi-echelon production planning problems
1989,
Recently there has been a flurry of research in the area of production planning for...
A simple complexity proof for a polynomial-time linear programming algorithm
A simple complexity proof for a polynomial-time linear programming algorithm
1989,
In this article a polynomial-time algorithm for linear programming is proposed. This...
Linear utility theory for belief functions
Linear utility theory for belief functions
1989,
In uncertainty situations where knowledge is described by a Dempster-Shafer belief...
An Aspiration-Level Interactive Method (AIM) for decision making
An Aspiration-Level Interactive Method (AIM) for decision making
1989,
An Aspiration-Level Interactive Method (AIM) for decision making provides a simple,...
Papers per page: