A cutting plane method for solving harvest scheduling models with area restrictions

DOI10.1016/j.ejor.2013.01.020zbMath1332.90150OpenAlexW2029006729MaRDI QIDQ257266

Nóra Könnyű, Sándor F. Tóth

Publication date: 15 March 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.01.020

zbMATH Keywords

integer programmingcutting planesOR in natural resourcesspatially-explicit harvest scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items

Sustainable operations ⋮ Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints ⋮ Long-term plantation and harvesting planning for industrial plantation forest areas ⋮ A multi-objective Monte Carlo tree search for forest harvest scheduling

Uses Software

• CPLEX
• Algorithm 97

Cites Work

• Unnamed Item
• Even-aged restrictions with sub-graph adjacency
• A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
• Mining market data: a network approach
• An Automatic Method of Solving Discrete Programming Problems
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
• A concise guide to the Traveling Salesman Problem
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Properties of vertex packing and independence system polyhedra
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• Solution of a Large-Scale Traveling-Salesman Problem
• A Theorem on Boolean Matrices
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut