Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems

DOI10.1016/j.ejor.2005.09.016zbMath1102.90028MaRDI QIDQ852995

Juan Pablo Vielma, David M. Ryan, Alan T. Murray, Andrés P. Weintraub

Publication date: 15 November 2006

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

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

zbMATH Keywords

combinatorial optimization; branch and bound; elastic constraints; forest planning; constraint branching

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

Uses Software

• CPLEX