There exists computational experience to the effect that search algorithms of the type introduced by Balas are frequently ineffective because of being tied to a rigid “natural” search origin. In this paper the dynamic relocation of the search origin to possibly more appropriate points is advocated. Details of such a procedure are given for the Simple Plant Location Problem. Computational improvements of, sometimes, a striking nature are presented.

Erratum to Mairs, Thomas G., Glenn W. Wakefield, Ellis L. Johnson, Kurt Spielberg. 1978. On a production allocation and distribution problem. Management Sci. 24 (November).

We describe a production allocation problem which was worked on at Frito-Lay and an integer programming model formulated for its solution. In connection with model formulation, we discuss estimation and collection of the required cost coefficients. Finally, we report on the use of two different linear programs, representing the same integer problem, which gave dramatically different running times to solve the integer programs. Some reasons for the improved running times are given.