Journal: Operations Research Letters

Found 1763 papers in total
Finding odd cycle transversals
Finding odd cycle transversals
2004,
We present an O( mn ) algorithm to determine whether a graph G with m edges and n...
The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle
The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle
2004,
Triangulated irregular networks (TINs) are common representations of surfaces in...
Min–max tree covers of graphs
Min–max tree covers of graphs
2004,
We provide constant factor approximation algorithms for covering the nodes of a graph...
A better approximation algorithm for the budget prize collecting tree problem
A better approximation algorithm for the budget prize collecting tree problem
2004,
Given an undirected graph G=(V,E) , an edge cost c(e)⩾0 for each edge e...
A note on hop-constrained walk polytopes
A note on hop-constrained walk polytopes
2004,
A hop-constrained walk is a walk with at most H arcs. The cases H ⩽3 have been...
An approximation algorithm for the edge-dilation k-center problem
An approximation algorithm for the edge-dilation k-center problem
2004,
We provide an approximation algorithm for selecting centers in a complete graph so as...
Performance of the move-to-front algorithm with Markov-modulated request sequences
Performance of the move-to-front algorithm with Markov-modulated request sequences
1999,
We study the classical move-to-front (MTF) algorithm for self-organizing lists within...
Admission control with batch arrivals
Admission control with batch arrivals
2004,
We consider the problem of dynamic admission control in a multi-class Markovian loss...
Stability of mixed generalized Jackson networks
Stability of mixed generalized Jackson networks
1999,
Jackson networks are typically open or closed: Either all customers join the network...
Cycle times in single server cyclic Jackson networks
Cycle times in single server cyclic Jackson networks
2004,
Using the arrival theorem together with elementary facts regarding integrated tail...
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines
Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines
2004,
We investigate classical satisfiability tests for P|r i , -->d --> i...
Equivalence of two linear programming relaxations for broadcast scheduling
Equivalence of two linear programming relaxations for broadcast scheduling
2004,
A server needs to compute a broadcast schedule for n pages whose request times are...
On-line scheduling to minimize average completion time revisited
On-line scheduling to minimize average completion time revisited
2004,
We consider the scheduling problem of minimizing the average-weighted completion time...
On embedding the volume algorithm in a variable target value method
On embedding the volume algorithm in a variable target value method
2004,
We employ the volume algorithm as a subgradient deflection strategy in a variable...
On the controversy over tailweight of distributions
On the controversy over tailweight of distributions
2004,
Although understanding tail behavior of distributions is important in many areas, such...
Exact solution of the SONET ring loading problem
Exact solution of the SONET ring loading problem
1999,
In this paper we address the problem of planning the capacity of the local rings in...
An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6
An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6
2004,
This paper presents an alternative proof for the non-existence of orthogonal Latin...
Optimality criterion for a class of nonlinear integer programs
Optimality criterion for a class of nonlinear integer programs
2004,
Graver's optimality conditions based on Hilbert bases apply to an integer program with...
An improved approximation algorithm for the partial Latin square extension problem
An improved approximation algorithm for the partial Latin square extension problem
2004,
Previous work on the partial Latin square extension (PLSE) problem resulted in a...
On the modulus algorithm for the linear complementarity problem
On the modulus algorithm for the linear complementarity problem
2004,
Concerning three subclasses of P -matrices the modulus algorithm and the projected...
Enumerating maximal independent sets with applications to graph colouring
Enumerating maximal independent sets with applications to graph colouring
2004,
We give tight upper bounds on the number of maximal independent sets of size k (and at...
Lift-and-projrct ranks and antiblocker duality
Lift-and-projrct ranks and antiblocker duality
2005,
We present a very short proof of the beautiful result of Aguilera et al . that the...
Worst-case behavior of the maximum vertex covering algorithm heuristic for the minimum labeling spanning tree problem
Worst-case behavior of the maximum vertex covering algorithm heuristic for the minimum labeling spanning tree problem
2005,
In this paper, we review recent work on the minimum labeling spanning tree problem and...
Optimal replenishment policy for product with season pattern demand
Optimal replenishment policy for product with season pattern demand
2005,
This paper investigates a deterministic inventory model in which demand follows a...
Papers per page: