A branch-and-price approach for harvest scheduling subject to maximum area restrictions

DOI10.1007/s10589-010-9347-1zbMath1245.90062OpenAlexW2088352547MaRDI QIDQ434163

Filipe Alvelos, Isabel Martins, Miguel Fragoso Constantino

Publication date: 10 July 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-010-9347-1

zbMATH Keywords

integer programmingcolumn generationspatial modelingforest management scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items (4)

Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints ⋮ Forest harvest scheduling with clearcut and core area constraints ⋮ Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity ⋮ A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability

Uses Software

• CPLEX

Cites Work

• Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
• A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
• Column Generation
• Simulation-Based Booking Limits for Airline Revenue Management
• Selected Topics in Column Generation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A branch-and-price approach for harvest scheduling subject to maximum area restrictions