Crop rotation scheduling with adjacency constraints
From MaRDI portal
(Redirected from Publication:666491)
Recommendations
- Um modelo para a programação de rotações de culturas
- Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
- Sustainable vegetable crop supply problem
- A branch-and-price-and-cut approach for sustainable crop rotation planning
Cites work
Cited in
(17)- Scheduling contractors' farm‐to‐farm crop harvesting operations
- 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
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
- Sustainable vegetable crop supply problem with perishable stocks
- The crop plant scheduling problem
- Sustainable operations
- A MIP flow model for crop-rotation planning in a context of forest sustainable development
- A portfolio theory approach to crop planning under environmental constraints
- Crop succession requirements in agricultural production planning
- Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty
- The -constrained method to solve a bi-objective problem of sustainable cultivation
- Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints
- Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation
- Multi-objective optimization for integrated sugarcane cultivation and harvesting planning
- A branch-and-price-and-cut approach for sustainable crop rotation planning
This page was built for publication: Crop rotation scheduling with adjacency constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666491)