AbstractIt is demonstrated that mixed-integer programming can be applied successfully to the solution of certain practical site location problems. A mixed-integer model of a frequently occurring form of warehouse location problem is presented. Experience with models of this type is described with examples of computational performance. The flexibility of mixed-integer models and the approach to their use as aids to decision-making are discussed.