A branch-and-price-and-cut approach for sustainable crop rotation planning

Open Webpage

Laurent Alfandari, Agnès Plateau, Xavier Schepler

Published: 01 Jan 2015, Last Modified: 14 May 2025Eur. J. Oper. Res. 2015EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•A new fully-combinatorial sustainable crop planning problem is proven NP-hard.•A {0,1} linear programming formulation and an extended formulation are provided.•The sub-problem in the extended formulation has the integrality property.•A Branch-and-Price-and-Cut (BPC) algorithm is proposed.•Comparative results for a large set of instances show the effectiveness of BPC.