An application of deterministic and robust optimization in the wood cutting industry

DOI10.1007/s10288-014-0265-4zbMath1320.90051OpenAlexW2003171655MaRDI QIDQ2342918

Morten Tiedemann, Stephan Westphal, Felix Haiduk, Jonas Ide

Publication date: 29 April 2015

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-014-0265-4

zbMATH Keywords

uncertaintymulti-objective optimizationrobustnessmodelingapplicationcutting stock

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (9)

Minmax robustness for multi-objective optimization problems ⋮ Application of optimization for solving a sawing stock problem with a cant sawing pattern ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty ⋮ Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts

Cites Work

• Unnamed Item
• Unnamed Item
• Minmax robustness for multi-objective optimization problems
• Generalized light robustness and the trade-off between robustness and nominal quality
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• A branch-and-price algorithm for solving the cutting strips problem
• A typology of cutting and packing problems
• An improved typology of cutting and packing problems
• Robust Convex Optimization
• A Scenario-Based Approach for Robust Linear Optimization
• Introduction to Stochastic Programming
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Light Robustness
• An algorithm for a cutting stock problem on a strip
• Robust Optimization for Empty Repositioning Problems
• Multicriteria Optimization
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

This page was built for publication: An application of deterministic and robust optimization in the wood cutting industry