The first algorithms for the on-line two-dimensional rectangle packing problem were introduced by Coppersmith and Raghavan. They showed that for a family of heuristics 13/4 is an upper bound for the asymptotic worst-case ratios. We have investigated the Next Fit and the First Fit variants of...

We consider an economic order quantity type model with unit out-of-pocket holding costs, unit opportunity costs of holding, fixed ordering costs and general transportation costs. For these models, we analyze the associated optimization problem and derive an easy procedure for determining a...

A probabilistic analysis is presented of the Next Fit Decreasing bin packing heuristic, in which bins are opened to accomodate the items in order of decreasing size.

In this note we present a simplified proof of a lower bound for on-line bin packing. This proof also covers the well-known result given by Liang in Inform. Process Lett. 10 (1980) 76–79.

The LPT rule is a heuristic method to distribute jobs among identical machines so as to minimize the makespan of the resulting schedule. If the processing times of the jobs are assumed to be independent identically distributed random variables, then (under a mild condition on the distribution)...

In this note we give a short and easy proof of the equivalence of Hakimi's one-median problem and the k-server-facility-loss median problem as discussed by Chiu and Larson in Computer and Operation Research. The proof makes only use of a stochastic monotonicity result for birth and death...

We give a new, short proof that four certain axiomatic properties uniquely define the center of a tree.

Reasonable descent is a novel, transparent approach to a well-established field: the deep methods and applications of the complete analysis of continuous optimization problems. Standard reasonable descents give a unified approach to all standard necessary conditions, including the Lagrange...

Correspondence analysis (CA) is a popular method that can be used to analyze relationships between categorical variables. It is closely related to several popular multivariate analysis methods such as canonical correlation analysis and principal component analysis. Like principal component...

In this paper we give a complete analysis of the joint replenishment problem (JRP) under constant demands and continuous time. We present a solution method for the JRP when a correction is made for empty replenishments, and we test the solution procedures with real data. We show that the...