Journal: Operations Research Letters

Found 1763 papers in total
Decomposition of the single machine total tardiness problem
Decomposition of the single machine total tardiness problem
1996,
The paper deals with the single machine total tardiness problem. It develops a new...
Efficient algorithms for the reliabilities of replicated n-parallel-task graphs
Efficient algorithms for the reliabilities of replicated n-parallel-task graphs
1996,
An n -parallel-task graph consists of an input node v 0 (the source), an output node v...
Bin packing using semi-ordinal data
Bin packing using semi-ordinal data
1996,
Algorithms for the bin packing problem are examined, under the ‘ordinal...
Submodular containment is hard, even for networks
Submodular containment is hard, even for networks
1996,
Suppose that we have two submodular base polyhedra in the same space. What is the...
Numerical solution for optimization over the efficient set by d.c. optimization algorithms
Numerical solution for optimization over the efficient set by d.c. optimization algorithms
1996,
In this paper we outline a d.c. optimization scheme and use it for (locally)...
A characterization of efficient points in constrained location problems with regional demand
A characterization of efficient points in constrained location problems with regional demand
1996,
In this paper we characterize the set of efficient points in the planar...
An exact algorithm for IP column generation
An exact algorithm for IP column generation
1996,
An exact column generation algorithm for integer programs with a large (implicit)...
Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
1996,
Lagrangian duality is a frequently used technique for solving specially structured...
A necessary second-order optimality condition in nonsmooth mathematical programming
A necessary second-order optimality condition in nonsmooth mathematical programming
1996,
Generalized second-order directional derivatives for nonsmooth real-valued functions...
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
1996,
We propose a method for finding the efficient set of a multiple objective linear...
Analyzing GI/Er/1 queues
Analyzing GI/Er/1 queues
1996,
In this paper we study a single-server system with Erlang- r distributed service times...
Inferring most likely queue length from transactional data
Inferring most likely queue length from transactional data
1996,
This paper presents an efficient algorithm for inferring a most likely length of an...
Autoregressive to anything: Time-series input processes for simulation
Autoregressive to anything: Time-series input processes for simulation
1996,
We develop a model for representing stationary time series with arbitrary marginal...
A conservative method for selecting the best simulated system
A conservative method for selecting the best simulated system
1996,
Multinomial data are often produced in simulation experiments designed for comparing...
General Hit-and-Run Monte Carlo sampling for evaluating multidimensional integrals
General Hit-and-Run Monte Carlo sampling for evaluating multidimensional integrals
1996,
We elaborate on the Hit-and-Run sampler, a Monte Carlo approach that estimates the...
Cumulative operating time distributions for a class of non-Markovian series systems
Cumulative operating time distributions for a class of non-Markovian series systems
1996,
Consider a series system with separately and independently maintained components. The...
On minimal cost-reliability ratio spanning trees and related problems
On minimal cost-reliability ratio spanning trees and related problems
1996,
The minimal cost-reliability ratio spanning tree problem is to find a spanning tree...
Computational aspects of the maximum diversity problem
Computational aspects of the maximum diversity problem
1996,
We address two variations of the maximum diversity problem which arises when m...
An O(pn2) algorithm of the p-median and related problems on tree graphs
An O(pn2) algorithm of the p-median and related problems on tree graphs
1996,
We improve the complexity bound of the p -median problem on trees by showing that the...
k-edge connected polyhedra on series–parallel graphs
k-edge connected polyhedra on series–parallel graphs
1996,
We give a complete description of the k -edge connected spanning subgraph polytope...
A note on the Boolean quadric polytope
A note on the Boolean quadric polytope
1996,
We observe that a new class of facet-defining inequalities for the Boolean quadric...
Observing general service queues before joining
Observing general service queues before joining
1996,
A ‘smart’ customer S uses a strategy of waiting and observing two parallel...
On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues
1996,
In this paper the authors discuss the discrete-time GI/Geom/1 queue and derive...
Correlation-inducing variance reduction in regenerative simulation
Correlation-inducing variance reduction in regenerative simulation
1996,
This paper proposes a variance reduction technique that can be applied to regenerative...
Papers per page: