A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
DOI10.1016/J.EJOR.2015.03.035zbMATH Open1346.90313OpenAlexW2099924311MaRDI QIDQ319637FDOQ319637
Pedro Munari, Alysson M. Costa, Lana M. R. Santos, Ricardo H. S. Santos
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
Recommendations
- A branch-and-price-and-cut approach for sustainable crop rotation planning
- Sustainable vegetable crop supply problem
- Um modelo para a programação de rotações de culturas
- Crop rotation scheduling with adjacency constraints
- Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints
branch-price-and-cutcrop rotation schedulingOR in agriculturestrong branchingsubadditive valid inequalities
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Production models (90B30)
Cites Work
- A Computational Study of Search Strategies for Mixed Integer Programming
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Selected Topics in Column Generation
- Branching rules revisited
- Branch-and-price: Column generation for solving huge integer programs
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Column generation based primal heuristics
- New classes of fast lower bounds for bin packing problems
- Crop succession requirements in agricultural production planning
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Sustainable vegetable crop supply problem
- A branch-and-price-and-cut approach for sustainable crop rotation planning
- Reformulation and Decomposition of Integer Programs
- 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
Cited In (13)
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints
- Um modelo para a programação de rotações de culturas
- Solving crop planning and rotation problems in a sustainable agriculture perspective
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- A sequential stochastic mixed integer programming model for tactical master surgery scheduling
- Sustainable operations
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- Optimization model to support sustainable crop planning for reducing unfairness among farmers
- Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty
- Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints
- The \(\varepsilon\)-constrained method to solve a bi-objective problem of sustainable cultivation
- Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation
- Multi-objective optimization for integrated sugarcane cultivation and harvesting planning
Uses Software
This page was built for publication: A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319637)
