Pages that link to "Item:Q319637"
From MaRDI portal
The following pages link to A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637):
Displaying 12 items.
- Sustainable operations (Q323159) (← links)
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- A sequential stochastic mixed integer programming model for tactical master surgery scheduling (Q1651732) (← links)
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
- The \(\varepsilon\)-constrained method to solve a bi-objective problem of sustainable cultivation (Q2089440) (← links)
- Optimization model to support sustainable crop planning for reducing unfairness among farmers (Q2155144) (← links)
- Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation (Q2159531) (← links)
- Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty (Q2178368) (← links)
- Improved mathematical model and bounds for the crop rotation scheduling problem with adjacency constraints (Q2424771) (← links)
- Solving crop planning and rotation problems in a sustainable agriculture perspective (Q6047856) (← links)
- Multi-objective optimization for integrated sugarcane cultivation and harvesting planning (Q6167760) (← links)
