Date

1967

Document Type

Thesis

Degree

Master of Science

Department

Industrial Engineering

First Adviser

Whitehouse, Gary E.

Abstract

The location-allocation problem is treated from the standpoint of the computational efficiency of a mixed-integer programming formulation solved by a branch-and-bound algorithm. Previous formulations of the problem are analyzed and a new formulation is developed.

Share

COinS