In many computational experiments, correlation is induced between certain types of coefficients in synthetic (or simulated) instances of classical optimization problems. Typically, the correlations that are induced are only qualified—that is, described by their presumed intensity. We quantify the population correlations induced under several strategies for simulating 0–1 knapsack problem instances and also for correlation-induction approaches used to simulate instances of the generalized assignment, capital budgeting (or multidimensional knapsack), and set-covering problems. We discuss implications of these correlation-induction methods for previous and future computational experiments on simulated optimization problems.

Two techniques for modeling a cellular telephone system are shown. Both of the techniques are based on a data base of experimentally measured data on signal strength as a function of location in the service area. Both techniques produce geographic maps of the system performance. Optimization routines are run on the model system to improve the operational statistics of the systems. Comparisons with the central Ohio Cellular One system are given.>

A satellite system synthesis problem, the satellite location problem (SLP), is addressed. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the fixed satellite service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: the problem of ordering the satellites and the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, that has been developed to find solutions to SLPs formulated in the manner suggested is described. Solutions to small example problems are presented and analyzed on the basis of calculated interferences.>

A mixer-integer programming formulation is presented of a satellite system synthesis problem, or geostationary-orbital-planning synthesis problem, which is referred to as the arc allotment problem (AAP). Each satellite administration is to be allotted a weighted-length segment of the geostationary orbital arc within which its satellites may be positioned at any longitude. The objective function maximizes the length of the unweighted arc segment allotted to every administration, subject to single-entry cochannel interference restrictions and constraints imposed by the visible arc for each administration. Useful relationships between special cases of AAP and another satellite synthesis problem are established. Solutions to two example problems are presented.>