Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints

DOI10.1016/j.ejor.2019.04.016zbMath1430.90280OpenAlexW2937848009WikidataQ128019328 ScholiaQ128019328MaRDI QIDQ2424771

Geraldo Regis Mauri

Publication date: 25 June 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.04.016

zbMATH Keywords

Lagrangian relaxationcolumn generationcombinatorial optimizationLagrangian decompositioncrop rotation scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Optimal crop allocation including market trends and water availability ⋮ Solving crop planning and rotation problems in a sustainable agriculture perspective

Cites Work

• A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
• Sustainable operations
• A column generation approach for the unconstrained binary quadratic programming problem
• Crop rotation scheduling with adjacency constraints
• A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
• Mixed integer linear programming models for optimal crop selection
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
• Sustainable vegetable crop supply problem
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems
• A branch-and-price-and-cut approach for sustainable crop rotation planning
• Lagrangean decompositions for the unconstrained binary quadratic programming problem
• Lagrangean decomposition: A model yielding stronger lagrangean bounds

This page was built for publication: Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints