This paper examines the proximity network establishment problem for a collection of fractionated spacecraft modules initially scattered in space. The objective is to find trajectory corrections that bring the space modules into a stable orbit that forms a connected network with minimum control efforts. We discuss a number of possible stable spacecraft formations and formulate the original problem as a parameter optimization problem with both connectivity constraints and stable formation constraints at the final boundary point. Two approaches, exhaustive global search and a relaxed nonlinear programming algorithm, are developed to calculate the solution of the resulting combinatorial optimization problem for networks of varying scales. Simulation results for inducing connected networks for both in-plane and circular spacecraft formations are provided and compared in terms of efficiency, cost, and complexity.