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.

This paper conducts a probabilistic analysis of an important class of heuristics for multiitem capacitated lot sizing problems. We characterize the asymptotic performance of so-called progressive interval heuristics as T, the length of the planning horizon, goes to infinity, assuming the data...

Purpose – The purpose of this paper is to associate a probabilistic confidence with the stock market interval forecasts obtained with the interval least squares (ILS) algorithm. The term probabilistic confidence in this paper means the probability of a point observation that will fall in the...

The Linear Programming Problem is by far the most widely used optimization model. Its impact on economic and government modeling is immense. The Simplex Method for solving the Linear Programming (LP) Problem, due to George Dantzig, has been an extremely efficient computational tool for almost...

Drought is a natural phenomenon that presents spatial and temporal features whose knowledge is fundamental for an appropriate water resources management. In particular, the assessment of probabilities and return periods of areal extent of droughts of different severities over a region can...

<Para ID="Par1">This paper deals with the average-case-analysis of the number of pivot steps required by the simplex method. It generalizes results of Borgwardt (who worked under the assumpution of the rotation-symmetry-model) for the shadow-vertex-algorithm to so-called cylindric distributions. Simultaneously...</para>

We propose a novel model for dispatching trucks given the constraints and sources of uncertainty that arise in drayage operations. The proposed model is designed to minimize the expected cost and is generally applicable to cases including different distributions of random parameters. Numerical...

We present a new approximation algorithm for the two-dimensional bin-packing problem. The algorithm is based on two one-dimensional bin-packing algorithms. Since the algorithm is of next-fit type it can also be used for those cases where the output is required to be on-line (e. g. if we open an...

In the distributive sorting method of Dobosiewicz, both the interval between the minimum and the median of the numbers to be sorted and the interval between the median and the maximum are partitioned inton/2 subintervals of equal length; the procedure is then applied recursively on each...