Crop rotation scheduling with adjacency constraints
From MaRDI portal
Publication:666491
DOI10.1007/s10479-008-0478-zzbMath1233.90168OpenAlexW2067993677MaRDI QIDQ666491
Ricardo Henrique Silva Santos, Lana Mara Rodrigues dos Santos, Philippe Yves Paul Michelon, Marcos Nereu Arenales
Publication date: 8 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0478-z
Related Items (12)
Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints ⋮ A branch-and-price-and-cut approach for sustainable crop rotation planning ⋮ A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes ⋮ Sustainable operations ⋮ Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation ⋮ Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty ⋮ Solving crop planning and rotation problems in a sustainable agriculture perspective ⋮ Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints ⋮ Multi-objective optimization for integrated sugarcane cultivation and harvesting planning ⋮ A portfolio theory approach to crop planning under environmental constraints ⋮ Sustainable vegetable crop supply problem with perishable stocks ⋮ The \(\varepsilon\)-constrained method to solve a bi-objective problem of sustainable cultivation
Uses Software
Cites Work
This page was built for publication: Crop rotation scheduling with adjacency constraints