Multi-commodity supply network planning in the forest supply chain
From MaRDI portal
Publication:1027559
DOI10.1016/j.ejor.2008.03.024zbMath1163.90830MaRDI QIDQ1027559
Jean-Marc Frayret, Satyaveer S. Chauhan, Luc LeBel
Publication date: 30 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.03.024
integer programming; dynamic programming; branch-and-price; supply planning; cut-to-length timber procurement
90C90: Applications of mathematical programming
90C10: Integer programming
90C39: Dynamic programming
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facility location models for distribution planning
- Forest management challenges for operational researchers
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
- Solving binary cutting stock problems by column generation and branch- and-bound
- Optimization in forestry
- Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches.
- The simple plant location problem: Survey and synthesis
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- One-dimensional cutting stock problem to minimize the number of different patterns
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Decomposition Principle for Linear Programs
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Branch-and-Bound Methods: General Formulation and Properties