The location of physical field sources in fixed places is optimized. Every source should be put in one place. The sources should not overlap and go beyond the location areas. The location quality criterion is defined by maximum values of the physical field at specified points. An algorithm based on the method of potentials is proposed to solve the problem and is analyzed for efficiency.The assignment problem was analyzed in many studies. The paper [1] deals with a two-level assignment problem to be solved with the branch-and-bound algorithm. The paper [2] generalizes the minimax assignment problem and proposes a solution algorithm of pseudo-polynomial complexity. The study [3] finds nonintersecting and noncoinciding cycles on a network with two weights of arcs and describes the main stages of the polynomial algorithm to solve the problem in the general case. To increase the performance of the programs (for example, those solving assignment problems), the paper [4] presents an efficient implementation of tree structures, which considerably reduces the run time.We will consider a special minimax assignment problem, which arises in arranging sources of a physical field [5]. The authors are unaware of algorithms to solve it. We propose an algorithm for approximate solution. Numerical results for a specific problem will be presented in the Appendix.