Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints

DOI10.1007/s11750-020-00580-zzbMath1467.90017OpenAlexW3048615764MaRDI QIDQ828768

Víctor M. Albornoz, Gabriel E. Zamora

Publication date: 5 May 2021

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-020-00580-z

zbMATH Keywords

column generationbinary integer programmingcrop planningcolumn-dependent rowsmanagement zones

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Management decision making, including multiple objectives (90B50) Decomposition methods (49M27)

Related Items (1)

A branch-and-price approach for the continuous multifacility monotone ordered median problem

Cites Work

• Decomposition based hybrid metaheuristics
• A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes
• Operational research models applied to the fresh fruit supply chain
• Sustainable vegetable crop supply problem with perishable stocks
• Crop rotation scheduling with adjacency constraints
• Algorithms for the one-dimensional two-stage cutting stock problem
• Mixed integer linear programming models for optimal crop selection
• Column generation for linear and integer programming
• Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty
• Sustainable vegetable crop supply problem
• Application of planning models in the agri-food supply chain: A review
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
• Solving a class of stochastic mixed-integer programs with branch and price
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
• A survey on matheuristics for routing problems
• A branch-and-price-and-cut approach for sustainable crop rotation planning
• Solving a rich vehicle routing and inventory problem using column generation
• Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Column Generation
• Selected Topics in Column Generation

This page was built for publication: Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints