Journal: Operations Research Letters

Found 1763 papers in total
New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
1997,
This paper is concerned with the global optimization of polynomial programming...
Sensitivity analysis of an (s,S) inventory model
Sensitivity analysis of an (s,S) inventory model
1997,
We provide a sensitivity analysis of the standard periodic-review ( s , S ) inventory...
A note on the characterization of the Barlow and Wu continuum structure functions
A note on the characterization of the Barlow and Wu continuum structure functions
1997,
A set of three conditions are developed which characterize generalized Barlow–Wu...
An algorithm for the quickest path problem
An algorithm for the quickest path problem
1997,
The quickest path problem arises when transmitting a given amount of data between two...
Modifying the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method
Modifying the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method
1997,
We propose a modified BFGS method and study the global and superlinear convergence...
On superlinear convergence of quasi-Newton methods for nonsmooth equations
On superlinear convergence of quasi-Newton methods for nonsmooth equations
1997,
We show that strong differentiability at solutions is not necessary for superlinear...
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
1997,
The formulation of interior point algorithms for semidefinite programming has become...
Polling on a space with general arrival and service time distribution
Polling on a space with general arrival and service time distribution
1997,
We consider a polling system on a space with general independent arrival, service and...
Limits and approximations for the M/G/1 LIFO waiting-time distribution
Limits and approximations for the M/G/1 LIFO waiting-time distribution
1997,
We provide additional descriptions of the steady-state waiting-time distribution in...
Asymptotic normality of discounted random series with applications in reliability and queueing
Asymptotic normality of discounted random series with applications in reliability and queueing
1997,
It is proved that a certain kind of randomly discounted random sums is asymptotically...
A note on center problems with forbidden polyhedra
A note on center problems with forbidden polyhedra
1997,
The problem of finding an optimal location X * minimizing the maximum Euclidean...
Sufficient conditions for coincidence in 𝓁1-minisum multifacility location problems
Sufficient conditions for coincidence in 𝓁1-minisum multifacility location problems
1997,
We consider the problem of finding the optimal way of locating a finite number of...
Expenditure patterns and timing of patent protection in a competitive R&D environment
Expenditure patterns and timing of patent protection in a competitive R&D environment
1997,
In this paper we consider a stochastic R&D decision model for a single firm...
Dynamic lot sizing with random demand and non-stationary costs
Dynamic lot sizing with random demand and non-stationary costs
1997,
We describe a formulation of the dynamic lot sizing problem when demand is random and...
On the probability distribution of total quality under sublot inspection and process restoration
On the probability distribution of total quality under sublot inspection and process restoration
1997,
A lot of N items is produced on a randomly degrading facility. The lot is split into...
A polynomial-time approximation scheme for maximizing the minimum machine completion time
A polynomial-time approximation scheme for maximizing the minimum machine completion time
1997,
We consider the problem of assigning a set of n jobs to a system of m identical...
Minimizing the total completion time in a unit-time open shop with release times
Minimizing the total completion time in a unit-time open shop with release times
1997,
We consider the problem of minimizing the total completion time in a unit-time open...
The complexity of scheduling job families about a common due date
The complexity of scheduling job families about a common due date
1997,
Family scheduling problems are characterized by a setup time structure where setups...
On finding two-connected subgraphs in planar graphs
On finding two-connected subgraphs in planar graphs
1997,
We consider a basic problem in the design of reliable networks, namely, that of...
A polynomial approximation scheme for problem F 2/rj /Cmax
A polynomial approximation scheme for problem F 2/rj /Cmax
1997,
We present a polynomial approximation scheme { H ϵ } for the strongly NP-hard...
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
Equivalence of the primal and dual simplex algorithms for the maximum flow problem
1997,
In this paper, we study the primal and dual simplex algorithms for the maximum flow...
Minimizing a linear multiplicative-type function under network flow constraints
Minimizing a linear multiplicative-type function under network flow constraints
1997,
In this paper, we consider a special class of nonconvex network flow problems, whose...
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
1997,
This paper reports a fast local search (FLS) algorithm which helps to improve the...
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
1997,
A cutting plane algorithm is presented for finding ϵ-appropriate solutions to...
Papers per page: