Showing papers in "Operations Research Letters in 2003"

TL;DR: It is shown that the MDA can be viewed as a nonlinear projected-subgradient type method, derived from using a general distance-like function instead of the usual Euclidean squared distance, and derived in a simple way convergence and efficiency estimates.

TL;DR: An algorithm which is designed for general graphs turns out to be an efficient alternative to the MSTH approach and some new equivalent relaxations of this problem are studied.

TL;DR: Two local search algorithms are proposed based on a decomposition of the problem into a sequencing and a timetabling problem, which outperform one of the best no-wait flow shop algorithms in literature.

TL;DR: Roughgarden and Tardos show that the cost of forgoing centralized control is mild, and shows that there is an upper bound for @r(@C) in @C for fixed demands with symmetric cost maps and fixed demands.

TL;DR: The Pareto dominance relation is shown to be the unique nontrivial partial order on the set of finite-dimensional real vectors satisfying a number of intuitive properties.

TL;DR: This work derives the failure time distribution and moments in terms of Laplace-Stieltjes transforms by analyzing the Markov additive process {(X(t),Z(t)):t>=0} and demonstrates its applicability on an example problem.

TL;DR: Two path-selection algorithms for the transport of hazardous materials can deal with link impedances that are path-dependent and are superior to a standard shortest path algorithm, common in the literature and practice, which results in inaccuracies.

TL;DR: A composite neighborhood structure is proposed that subsumes both the node-based and tree-based neighborhoods, and outperforms both the previous neighborhood search algorithms for solving the capacitated minimum spanning tree problem on standard benchmark instances.

TL;DR: In this article, the authors considered the problem of scheduling jobs on a single machine and on identical machines with the objective to minimize total completion time, and proposed a general 2-competitive algorithm for the single machine problem.

TL;DR: This paper considers equilibrium problems in vector metric spaces where the function f and the set K are perturbed by the parameters @e,@h, providing some results in the peculiar framework of generalized monotone functions.

TL;DR: The 'non-exact' Fischetti-Salazar-Toth (FST) transformation and its two modifications are studied in computational experiments and theoretically using domination analysis and one of the modifications is better than the original FST transformation in the worst case in terms of domination analysis.

TL;DR: This work investigates the special case where every color appears at most r times in the input graph, and shows that for k=2 any local optimum yields an (r+1)/2-approximation of the global optimum, and that this bound is tight.

TL;DR: In this article, the authors provided a direct probabilistic argument to show that the sojourn time under PS is equal (in distribution) to the waiting time under ROS of a customer arriving to a non-empty system.

TL;DR: This work proposes to solve the break minimization problem in sports scheduling by transforming it into a maximum cut problem in an undirected graph and applying a branch-and-cut algorithm.

TL;DR: This work proposes the first algorithmic approach which reoptimizes the shortest paths when any subset of arcs of the input graph is affected by a change of the costs, which can be either lower or higher than the old ones.

TL;DR: The implication of the results is that an inventory manager in a finite horizon situation who uses the infinite horizon expression to set stocking levels will achieve a higher than desired expected fill rate at greater than necessary inventory expense.

TL;DR: This paper proves convergence for a particular version of an algorithm that produces approximations from stochastic gradient information while maintaining concavity.

TL;DR: Large vector titers in small volumes of fluid were well tolerated with the round window approach resulting in complete hearing preservation with transfer of GFP to hair cells and spiral ganglion cells, and injection of comparable doses of vector into a basal turn cochleostomy resulted in high-frequency hearing loss.

TL;DR: This work investigates the asymptotic behavior of this estimator in the case of equal interval widths, and shows that it can be transformed into a consistent estimator if the interval lengths shrink at an appropriate rate as the amount of data grows.

TL;DR: By using the moments of the second and fourth orders, it is shown that the usual beta distribution in the PERT method is mesokurtic (@c=3) and of constant variance (@s^2=136).

TL;DR: It is shown that the problems of asserting whether an activity is possibly critical, and of computing bounds on the float of an activity in these networks are NP-complete and NP-hard, respectively.

TL;DR: Under a simple technological change model of a constant factor improvement in equipment costs per period, it is shown that the effect is to optimally delay the introduction of new technology.

TL;DR: It is proved that minimizing total tardiness is binary NP-hard, which has been an open problem in the literature and provides a nearly complete mapping of the complexity of scheduling an unbounded batch machine.

TL;DR: A functional equation for the generating function of the stationary distribution of this two-dimensional Markov process is derived and solved through the theory of Riemann-Hilbert boundary value problems.

TL;DR: This paper presents an O(nlogn) time algorithm for two-dimensional vector packing with absolute performance guarantee 2 and presents an asymptotic polynomial time approximation scheme for two dimensions for this problem.

TL;DR: Lactoferrin proved effective in reducing malignant tumor growth in a murine model and offer hope for its use as a primary or adjuvant chemotherapeutic agent.

TL;DR: The microbiology, diagnosis and management of deep facial infections and Lemierre syndrome are described and complications can be life threatening and can result from hematogenic or direct spread.

TL;DR: The permanent threshold shifts were significantly lower in the Mg than in the placebo group as measured by auditory brainstem response audiometry, distortion product otoacoustic emissions and compound action potentials 1 week after exposure.

TL;DR: This note shows an application of MA ordering to the maximum flow problem with integral capacities to get a new polynomial-time algorithm.