A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes

DOI10.1016/j.ejor.2015.03.035zbMath1346.90313OpenAlexW2099924311MaRDI QIDQ319637

Alysson M. Costa, Lana M. R. Santos, Ricardo H. S. Santos, Pedro Augusto Munari

Publication date: 6 October 2016

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

Full work available at URL: http://www.locus.ufv.br/handle/123456789/21636

zbMATH Keywords

branch-price-and-cutcrop rotation schedulingOR in agriculturestrong branchingsubadditive valid inequalities

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Case-oriented studies in operations research (90B90)

Related Items (12)

A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints ⋮ Sustainable operations ⋮ Optimization model to support sustainable crop planning for reducing unfairness among farmers ⋮ A sequential stochastic mixed integer programming model for tactical master surgery scheduling ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ 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 ⋮ The \(\varepsilon\)-constrained method to solve a bi-objective problem of sustainable cultivation

Uses Software

• ROTOR

Cites Work

• Sustainable vegetable crop supply problem with perishable stocks
• A MIP flow model for crop-rotation planning in a context of forest sustainable development
• Crop rotation scheduling with adjacency constraints
• Branch-and-price algorithms for the one-dimensional cutting stock problem
• Crop succession requirements in agricultural production planning
• Branching rules revisited
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Sustainable vegetable crop supply problem
• A branch-and-price-and-cut approach for sustainable crop rotation planning
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Column Generation based Primal Heuristics
• Reformulation and Decomposition of Integer Programs
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Computational Study of Search Strategies for Mixed Integer Programming
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• Selected Topics in Column Generation
• New classes of fast lower bounds for bin packing problems

This page was built for publication: A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes