We describe a cutting plane algorithm for an integer programming problem that arises in forest harvest scheduling. Spatial harvest scheduling models optimize the binary decisions of cutting or not cutting forest management units in different time period subject to logistical, economic and...

We present a new mixed-integer program for a multi-depot, multi-vehicle capacitated location-allocation routing problem (LARP). The model simultaneously selects the locations of facilities, allocates customers to the intermediate facilities, and identifies the optimal number of capacitated...