Journal: Operations Research Letters

Found 1763 papers in total
On the hardness of evaluating criticality of activities in a planar network with duration intervals
On the hardness of evaluating criticality of activities in a planar network with duration intervals
2003,
Complexity results for problems of evaluating the criticality of activities in planar...
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
2003,
The capacitated minimum spanning tree (CMST) problem is to find a minimum cost...
A greedy algorithm for multicut and integral multiflow in rooted trees
A greedy algorithm for multicut and integral multiflow in rooted trees
2003,
We present an O(min(Kn,n 2 )) algorithm to solve the maximum integral multiflow and...
A maximum flow algorithm using maximum adjacency ordering
A maximum flow algorithm using maximum adjacency ordering
2003,
Maximum adjacency (MA) ordering has effectively been applied to graph connectivity...
A new algorithm for reoptimizing shortest paths when the arc costs change
A new algorithm for reoptimizing shortest paths when the arc costs change
2003,
We propose the first algorithmic approach which reoptimizes the shortest paths when...
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
2003,
The two-dimensional vector packing problem is the generalization of the classical...
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem
2003,
We consider the average-case performance of a well-known approximation algorithm for...
An O(n log n) procedure for identifying facets of the knapsack polytope
An O(n log n) procedure for identifying facets of the knapsack polytope
2003,
An O(n log n) procedure is presented for obtaining facets of the knapsack polytope by...
Maximal descriptor set characterizations of efficient faces in multiple objective linear programming
Maximal descriptor set characterizations of efficient faces in multiple objective linear programming
2003,
In this paper we present the concept of maximal descriptor set as a way of identifying...
Convexity properties of loss and overflow functions
Convexity properties of loss and overflow functions
2003,
We show that the fluid loss ratio in a fluid queue with finite buffer b and constant...
A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times
A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times
2003,
A complete distribution for the system content of a discrete-time multi-server queue...
Optimal admission control in a queueing system with heterogeneous traffic
Optimal admission control in a queueing system with heterogeneous traffic
2003,
We consider optimal admission control of the GI/PH/1-type queueing system. The problem...
Nonexistence of a class of variate generation schemes
Nonexistence of a class of variate generation schemes
2003,
Motivated by a problem arising in the regenerative analysis of discrete-event system...
A note on the reasonableness of PERT hypotheses
A note on the reasonableness of PERT hypotheses
2003,
In this paper the expression for the mean in the PERT method is considered. This mean...
An algorithm for approximating piecewise linear concave functions from sample gradients
An algorithm for approximating piecewise linear concave functions from sample gradients
2003,
An effective algorithm for solving stochastic resource allocation problems is to build...
On the interplay between variability and negative dependence for bivariate distributions
On the interplay between variability and negative dependence for bivariate distributions
2003,
We investigate how increasing variability (in the sense of convex stochastic order) of...
Comparative statics of cell phone plans
Comparative statics of cell phone plans
2003,
Employing an order relation that is more restrictive than second-order stochastic...
Characterization of Pareto dominance
Characterization of Pareto dominance
2003,
The Pareto dominance relation is shown to be the unique nontrivial partial order on...
Mirror descent and nonlinear projected subgradient methods for convex optimization
Mirror descent and nonlinear projected subgradient methods for convex optimization
2003,
The mirror descent algorithm (MDA) was introduced by Nemirovsky and Yudin for solving...
On Steiner trees and minimum spanning trees in hypergraphs
On Steiner trees and minimum spanning trees in hypergraphs
2003,
The bottleneck of the state-of-the-art algorithms for geometric Steiner problems is...
On local search for the generalized graph coloring problem
On local search for the generalized graph coloring problem
2003,
Given an edge-weighted graph and an integer k , the generalized graph coloring problem...
Approximation algorithms for the metric maximum clustering problem with given cluster sizes
Approximation algorithms for the metric maximum clustering problem with given cluster sizes
2003,
The input to the metric maximum clustering problem with given cluster sizes consists...
Local search for the minimum label spanning tree problem with bounded color classes
Local search for the minimum label spanning tree problem with bounded color classes
2003,
In the Minimum Label Spanning tree problem, the input consists of an edge-colored...
On scheduling an unbounded batch machine
On scheduling an unbounded batch machine
2003,
A batch machine is a machine that can process up to c jobs simultaneously as a batch,...
Papers per page: