Dantzig-Wolfe reformulations for the forest harvest scheduling subject to maximum area restrictions

Abstract

We describe two Dantzig—Wolfe decompositions of the so-called bucket formulation for the forest harvest scheduling problem with maximum area restrictions. A heuristic solution to the problem is obtained by solving the final restricted master problem provided by column generation, enforcing the integrality constraints. We compare the approaches and present preliminary computational results.