Some management science models require estimates of distances between points in a road network based on the point coordinates. This paper evaluates the accuracy of a range of reasonable forms for distance estimating functions using samples of urban and rural road distances. The intent is to...

We consider a market economy that is composed of separate regions, each endowed with linear supply and demand curves and represented as a point on a transportation network. The problem addressed is to determine an equilibrium price in each region so that regional price differences do not exceed...

Some important conceptual problems concerning the application of chance constrained programming (CCP) to risky practical decision problems are discussed by comparing CCP to stochastic programming with recourse (SPR). We expand on Garstka's distinction between mathematical equivalence and...

Shift and days-off scheduling problems have received much attention in the literature of integer programming approaches to workforce scheduling. A typical managerial use would be to schedule full-time employees to minimize the number of labor hours while satisfying variable workforce...

We show in this reply that the response by Charnes and Cooper to our paper is aimed at an issue that is only tangential to our analysis and does not affect our conclusions.

This article develops the dual program corresponding to a hyperbolic approximation, of the constrained multi-facility location model using l_p distances. The dual program is original and is a contribution to the theory of facilities location as well as providing a new efficient method of...

The distances used in certain types of industrial, office or street grid layouts are often assumed to be rectangular. Because of the "doubling back" effect caused by finite block and facility sizes, actual distances travelled are often much greater than indicated by the l₁ norm. In this study...

Two geometric approaches to solving sequencing problems are described and tested. Both methods have yielded optimal or near optimal solutions in problems where the optimal is known. Further, these methods have the advantage of being programmable, with execution in relatively short computation...

A dynamic programming algorithm is presented to locate m variable facilities in relation to n existing facilities situated on one route. Each of the n existing facilities has a requirement flow which must be supplied by the variable facilities. The algorithm does the allocation simultaneously...

Rejoinder to the previous note (Erlenkotter, D. 1974. Note--Dynamic facility location and simple network models. Management Sci. 20 (9) 1311.).