This paper describes a quantitative model to aid in planning an efficient and effective hospital inpatient service among hospitals in a region. The planning is to be done by a regional health systems planning agency, which sets or enforces standards of accessibility and acceptability to be...

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.

This paper describes the theory, development, and application of an optimizing procedure for solving lock box location problems. Such problems have become increasingly important to banks, corporations, and governmental agencies in their quest for more efficient cash management. Extensive...

In this note, a node elimination procedure has been suggested in case the two sequences obtained by using Townsend's (Townsend, W. 1978. The single machine problem with quadratic penalty function of completion times: A branch and bound solution. Management Sci. 24 (5) 530--534.) sufficient...

The increased focus on heuristics for the approximate solution of integer programs has led to more sophisticated analysis methods for studying their performance. This paper is concerned with the worst-case approach to the analysis of heuristic performance. A worst-case study establishes the...

This paper is concerned with the problem of scheduling tasks on a system consisting of two parallel processors in order that makespan be minimized. In particular, we treat a variety of modifications to this basic theme, including the cases of identical, proportional, and unrelated processors. In...

The problem of decreasing the amount of testing for vision loss in persons susceptible to glaucoma is formulated as an integer optimization problem. Nonlinear and linear versions of the problem formulation are given, and both heuristic and exact algorithms are proposed. Testing with...

Pivot and Complement is a heuristic for finding approximate solutions to 0-1 programming problems. It uses the fact that a 0-1 program is equivalent to the associated linear program with the added requirement that all slack variables, other than those in the upper bounding constraints, be basic....

The two duty period scheduling problem is an integer programming problem with 0-1 constraint coefficients. It is recognized that the problem can be reformulated as a one duty period problem with side constraints. Since the one duty period problem can be solved as a minimal cost network flow...

A classification problem is presented in which it is desired to assign a new individual or observation with k characteristics to one of two distinct populations based upon historical sets of samples from the two populations. The resulting classification problem is formulated as a mixed-integer...