Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming

DOI10.1016/0305-0548(86)90049-3zbMath0615.90084OpenAlexW1978477717MaRDI QIDQ1821036

Parviz Ghandforoush, Brian J. Greber

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90049-3

zbMATH Keywords

production schedulingcomplex managementland-use allocation

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Uses Software

• LINDO

Cites Work

• Convexity cuts for multiple choice problems
• Technical Note—Solving Integer Programming Problems by Aggregating Constraints
• An all Zero-One Algorithm for a Certain Class of Transportation Problems
• Surrogate Constraints
• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)

This page was built for publication: Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming