Multi-commodity supply network planning in the forest supply chain

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

zbMATH Keywords

integer programming; dynamic programming; branch-and-price; supply planning; cut-to-length timber procurement

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C10: Integer programming

90C39: Dynamic programming

Related Items

Supply network planning in the forest supply chain with bucking decisions anticipation, Effects of different cut-to-length harvesting structures on the economic value of a wood procurement planning problem, Using mixed integer programming models to synchronously determine production levels and market prices in an integrated market for roundwood and forest biomass

Uses Software

• CPLEX

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item