Journal: Operations Research Letters

Found 1763 papers in total
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
1997,
Many numerical computations show a small difference only between the optimal value of...
A new approach to continuation methods for complementarity problems with uniform P-functions
A new approach to continuation methods for complementarity problems with uniform P-functions
1997,
We design a new continuation method for the solution of nonlinear complementarity...
Quadratic resource allocation with generalized upper bounds
Quadratic resource allocation with generalized upper bounds
1997,
In this paper we present an algorithm for solving a quadratic resource allocation...
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
1997,
This paper studies a two-machine flowshop scheduling problem with an availability...
Approximation-assisted point estimation
Approximation-assisted point estimation
1997,
We investigate three alternatives for combining a deterministic approximation with a...
Inverse barriers and CES-functions in linear programming
Inverse barriers and CES-functions in linear programming
1997,
Recently, much attention was paid to polynomial interior point methods, almost...
A characterization of an n by 2n ‘Q0’-matrix
A characterization of an n by 2n ‘Q0’-matrix
1997,
The class of matrices Q 0 , characterized as all n by n matrices M , for which the...
Resolution of the problem of degeneracy in a primal and dual simplex algorithm
Resolution of the problem of degeneracy in a primal and dual simplex algorithm
1997,
We resolve the problem of degeneracy in a recently developed primal–dual simplex...
Duality with multiple criteria and multiple resources
Duality with multiple criteria and multiple resources
1996,
We consider an extension of a linear model studied by Gale, Kuhn and Tucker (GKT) for...
A nonlinear Knapsack problem
A nonlinear Knapsack problem
1995,
The nonlinear Knapsack problem is to maximize a separable concave objective function,...
Difference of convex functions optimization algorithms (DCAs) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
Difference of convex functions optimization algorithms (DCAs) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
1996,
We present difference of convex functions optimization algorithms (DCA) for globally...
A note on the complexity of the Asymmetric Traveling Salesman Problem
A note on the complexity of the Asymmetric Traveling Salesman Problem
1997,
One of the most efficient approaches known for finding an optimal tour of the...
How difficult is the frequency selection problem?
How difficult is the frequency selection problem?
1995,
Frequency domain methodology has been applied to discrete-event simulations to...
Optimal and approximate bottleneck Steiner trees
Optimal and approximate bottleneck Steiner trees
1996,
Given a set of terminals in the plane, a bottleneck Steiner tree is a tree...
A combinatorial column generation algorithm for the maximum stable set problem
A combinatorial column generation algorithm for the maximum stable set problem
1997,
In this paper, we derive lower bounds on the size of a minimum cover of a graph G by...
On the discrete lot-sizing and scheduling problem with Wagner–Whitin costs
On the discrete lot-sizing and scheduling problem with Wagner–Whitin costs
1997,
We consider the single-item discrete lot-sizing and scheduling problem. We present a...
A descent proximal level bundle method for convex nondifferentiable optimization
A descent proximal level bundle method for convex nondifferentiable optimization
1995,
We give a proximal level method for convex minimization that uses projections onto...
Minimization of SC1 functions and the Maratos effect
Minimization of SC1 functions and the Maratos effect
1995,
We consider the unconstrained minimization of a continuously differentiable function...
An analytic center cutting plane method for pseudomonotone variational inequalities
An analytic center cutting plane method for pseudomonotone variational inequalities
1997,
We consider an analytic center algorithm for solving generalized monotone variational...
Generic rank-one corrections for value iteration in Markovian decision problems
Generic rank-one corrections for value iteration in Markovian decision problems
1995,
Given a linear iteration of the form x := F ( x ), we consider modified versions of...
A note on single-processor scheduling with time-dependent execution times
A note on single-processor scheduling with time-dependent execution times
1995,
We consider a single-processor scheduling model where the execution time of a task is...
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
1995,
In 1991, Hall et al. showed that the problem of minimizing the mean earliness and...
Optimal feedback controls in deterministic dynamic two-machine flowshops
Optimal feedback controls in deterministic dynamic two-machine flowshops
1996,
This paper studies deterministic dynamic two-machine flowshops. Optimal feedback...
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
1996,
We consider a single-machine scheduling problem in which job processing times are...
Papers per page: