Recently there has been considerable interest in the average-case performance of heuristics. This paper pursues that interest, where it concerns sequencing and packing problems. In particular, we survey the methods that have been used to obtain formal probabilistic analyses of heuristics for...

An important, recurring problem in statistics involves the determination of strata boundaries for use in stratified sampling. This paper describes a practical method for stratifying a population of observations based on optimal cluster analysis. The goal of stratification is constructing a...

(This article originally appeared in Management Science, January 1981, Volume 27, Number 1, pp. 1--18, published by The Institute of Management Sciences.) One of the most computationally useful ideas of the 1970s is the observation that many hard integer programming problems can be viewed as...

New lock box solution techniques have recently been suggested by Stone and Nauss-Markland. This paper briefly discusses these new methodologies and shows how the algorithms can be combined into a third solution procedure which exploits the computational efficiency of the Stone heuristic and...

Sufficient conditions have been developed for testing the optimality of solutions to all-integer and mixed-integer linear programming problems after coefficient changes in the right hand side and the objective function, or after introduction of new variables. The same conditions can be used as...

The objective of the one-center model (single facility minimax location in the plane) is changed to be the maximum weighted number of demand points within a given weighted distance from the facility. The paper presents an O(n² log n) algorithm for the model along with some computational experience.