"Two algorithms are developed, one exact, one approximate, for finding solutions to the simple plant location problem. Theorems are proved which give sufficient conditions for the inclusion of a plant in the optimal solution. The exact algorithm which is developed is similar to the Branch and Bound method. The approximate technique consists of a directed search through the solution tree for the problem, followed by terminal iterations. The terminal iterations are justified by empirical results obtained from a preliminary version of the technique and a theorem which is proved. Statistics from the results of applying the algorithm to a large number of problems are given. Listings of computer programs which are implementations of the algorithms are provided together with sample output from those programs"--Abstract, page ii.
Gillett, Billy E.
Wellek, Robert M.
Lee, Ralph E., 1921-2010
Ho, C. Y. (Chung You), 1933-1988
Rigler, A. Kellam
Penico, Anthony J., 1923-2011
Mathematics and Statistics
Ph. D. in Mathematics
National Science Foundation (U.S.)
University of Missouri--Rolla
vi, 85 pages
© 1970 John Bruce Prater, All rights reserved.
Dissertation - Open Access
Library of Congress Subject Headings
Industrial location -- Mathematical models
Industrial sites -- Location -- Mathematical models
Print OCLC #
Electronic OCLC #
Link to Catalog Recordhttp://laurel.lso.missouri.edu/record=b1067018~S5
Prater, John Bruce, "Search algorithms for the simple plant location problem" (1970). Doctoral Dissertations. 2255.