Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming
From MaRDI portal
Publication:1821036
DOI10.1016/0305-0548(86)90049-3zbMath0615.90084MaRDI 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
90C10: Integer programming
90C11: Mixed integer programming
90B35: Deterministic scheduling theory in operations research
90B30: Production models
Uses Software
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)