Several computer programs were developed to solve various versions of the quadratic capacitated facilities location problem. Matrices, which represent various business costs, are defined for the factors of sites, facilities, customers, commodities, and production units. The objective of the program is to find an optimization matrix for the lowest cost, given the restrictions of the problem. The algorithms, COMPAT and SWITCH, are devised to solve portions of the problem with the subroutines, CHANGE and MUNKRES. These programs are tried on several different problems, and the different results are compared. Suggestions for future research, particularly using Gilmore's branch and bound technique, are made. (WH)