Given a set of points in the plane, we consider geometric network optimization problems (such as the Traveling Salesperson Problem) with a specified bound on the total length of the network. The objective is to maximize the number of points visited (or the total ``value'' of points visited) by the network. We present good approximation algorithms for many related problems, several of which were considered hard to approximate.