Testing the use of lazy constraints in solving area-based adjacency formulations of harvest scheduling models

Keyphrases

• Area-based 100%
• Adjacency 100%
• Optimality Gap 100%
• Harvest-scheduling Model 100%
• Lazy Constraints 100%
• Path Constraints 66%
• Opening Size 66%
• Relative Superiority 66%
• Problem Size 33%
• Solution Approach 33%
• Combinatorial Problems 33%
• Solution Time 33%
• Spatially Explicit 33%
• Problem Instances 33%
• Management Units 33%
• Size Limit 33%
• Path Model 33%
• Unit Size 33%
• Close Analysis 33%

Computer Science

• Path Constraint 100%
• Combinatorial Problem 50%
• Problem Instance 50%