The m-Center Problem is to locate a given number of (emergency) facilities anywhere along a road network so as to minimize the maximum distance between these facilities and fixed demand locations assigned to them. Fundamental properties of the m-Center Problem are examined. The problem is...

We consider a problem of sequencing capacity expansion projects with a continuous demand function specified over a given time horizon. Each type of expansion project has a specified integer capacity and an associated cost which is nonincreasing with respect to the time at which the project is...

An algorithm is given which finds all optimal solutions, for a given set of criteria, to political redistricting problems. Using "population units" as indivisible elements, the first phase generates all feasible districts, where feasibility indicates contiguity, compactness and limited...

The objective of this note is (i) to identify and briefly review some references not included in [El-Shaieb, A. M. 1973. A new algorithm for locating sources among destinations. Management Sci. 20 221-231.] as well as more recent additions and (ii) to give computational comparisons of three...

A multi-terminal network consists of several demand nodes connected to a common source node through several intermediate nodes. The requirements at the demand nodes are nondecreasing functions of time. It is required to find the maximum time up to which all demands can be satisfied. In this...

A recent article in this Journal provides an efficient computational scheme for obtaining a regression line that minimizes the sum of absolute deviations of a set of two-dimensional points. The present note interprets that procedure as the solution of the parametric dual to the linear...

We model the situation where the productivity of members of a group, such as a salesforce, is periodically evaluated; those whose performance is sub-par are dismissed and replaced by new members. Individual productivity is modeled as a random variable, the distribution of which is a function of an...

The simplex method is specialized for a special class of networks with gains arising in discounted deterministic Markov decision models.

A deterministic capacity expansion and shipment planning problem is considered for a single commodity that can be produced in two regions. Demand in each region is nondecreasing over a finite time horizon. Demand in a region in a time period must be satisfied, either by the current production...

The problem considered is that of obtaining majority decisions which are transitive. We show that the corresponding optimization problems for the weighted l₁ norm and the weighted l₂ norm are identical. We then show that she general problem of minimizing the weighted l_k norm can be equivalently...