Journal: Operations Research Letters

Found 1763 papers in total
A monotone approximation algorithm for scheduling with precedence constraints
A monotone approximation algorithm for scheduling with precedence constraints
2008,
We provide a monotone O(m 2/3 ) -approximation algorithm for scheduling related...
A reflected diffusion process in a regime-switching environment
A reflected diffusion process in a regime-switching environment
2008,
This paper provides steady-state analysis of a reflected diffusion process governed by...
New formulations and valid inequalities for a bilevel pricing problem
New formulations and valid inequalities for a bilevel pricing problem
2008,
Consider the problem of maximizing the toll revenue collected on a multi-commodity...
An algorithm for achieving proportional delay differentiation
An algorithm for achieving proportional delay differentiation
2008,
We consider the implementation of the proportional delay differentiation model with...
Exploiting equalities in polynomial programming
Exploiting equalities in polynomial programming
2008,
We propose a novel approach for solving polynomial programs over compact domains with...
The inequality-satisfiability problem
The inequality-satisfiability problem
2008,
We define a generalization of the satisfiability problem (SAT) where each...
On the Kth best base of a matroid
On the Kth best base of a matroid
2008,
Given a weighted matroid M and a positive integer K , the K th best base of M problem...
A fixed point theorem for discontinuous functions
A fixed point theorem for discontinuous functions
2008,
Any function from a non-empty polytope into itself that is locally gross direction...
A note on the delay distribution in generalized processor sharing
A note on the delay distribution in generalized processor sharing
2008,
In this note a two-class generalized processor sharing system is considered. We...
Minimum Lk path partitioning – An illustration of the Monge property
Minimum Lk path partitioning – An illustration of the Monge property
2008,
We investigate the problem of cutting a given sequence of positive real numbers into p...
An inverse model for the most uniform problem
An inverse model for the most uniform problem
2008,
In this paper, we consider a kind of inverse model for the most uniform problem. This...
Efficiently packing unequal disks in a circle
Efficiently packing unequal disks in a circle
2008,
Placing non-overlapping circles in a smallest container is a hard task. In this paper...
A note on the mixed-integer rounding (MIR) closure
A note on the mixed-integer rounding (MIR) closure
2008,
In 1988, Nemhauser and Wolsey introduced the concept of MIR inequality for mixed...
Lot-sizing on a tree
Lot-sizing on a tree
2008,
For the problem of lot-sizing on a tree with constant capacities, or stochastic...
Bounds on the size of branch-and-bound proofs for integer knapsacks
Bounds on the size of branch-and-bound proofs for integer knapsacks
2008,
Using a direct counting argument, we derive lower and upper bounds for the number of...
The solution set structure of monotone linear complementarity problems over second-order cone
The solution set structure of monotone linear complementarity problems over second-order cone
2008,
The second-order cone linear complementarity problem (SOCLCP) is a generalization of...
Identifying the optimal partition in convex quadratic programming
Identifying the optimal partition in convex quadratic programming
2008,
Given an optimal solution for a convex quadratic programming (QP) problem, the optimal...
Algorithms for the universal and a priori traveling salesman problem (TSP)
Algorithms for the universal and a priori traveling salesman problem (TSP)
2008,
We present two simple results for generalizations of the traveling salesman problem...
Searching the k-change neighborhood for a traveling salesperson problem (TSP) is W[1]-hard
Searching the k-change neighborhood for a traveling salesperson problem (TSP) is W[1]-hard
2008,
We show that searching the k -change neighborhood is W[1]-hard for metric TSP, which...
Increasing convex ordering of queue length in bulk queues
Increasing convex ordering of queue length in bulk queues
2008,
This paper considers single-server bulk queues M (X) / G (Y) /1 and G (X) / M (Y) /1....
A new renewal approximation for certain autocorrelated processes
A new renewal approximation for certain autocorrelated processes
2008,
We propose a new renewal approximation for autocorrelated streams with limiting index...
Solving operational statistics via a Bayesian analysis
Solving operational statistics via a Bayesian analysis
2008,
For the newsvendor problem with ambiguous demand, it is known that integrating...
Asymptotic behavior of the stationary distribution in a finite quasi-birth-and-death (QBD) process with zero mean drift
Asymptotic behavior of the stationary distribution in a finite quasi-birth-and-death (QBD) process with zero mean drift
2008,
We consider a finite QBD process with m levels. Assuming that the mean drift is 0, we...
A risk-averse newsvendor with law invariant coherent measures of risk
A risk-averse newsvendor with law invariant coherent measures of risk
2008,
For general law invariant coherent measures of risk, we derive an equivalent...
Papers per page: