One-dimensional stock cutting resilient against singular random defects
From MaRDI portal
Publication:6106587
DOI10.1016/j.cor.2023.106280MaRDI QIDQ6106587
Fabrizio Marinelli, Claudio Arbib, Ulrich Pferschy, Fatemeh K. Ranjbar
Publication date: 3 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Exact solution of the robust knapsack problem
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- On the cutting stock problem under stochastic demand
- Knapsack problem with probability constraints
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- The stochastic trim-loss problem
- On the equal-subset-sum problem
- Determining cutting stock patterns when defects are present
- Integrated defect detection and optimization for cross cutting of wooden boards
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- A method for the cutting stock problem with different qualities
- Integer optimization with penalized fractional values: the knapsack case
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- Mathematical models and decomposition methods for the multiple knapsack problem
- Production planning in furniture settings via robust optimization
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- Solving robust bin-packing problems with a branch-and-price approach
- An exact model for a slitting problem in the steel industry
- An application of deterministic and robust optimization in the wood cutting industry
- An improved typology of cutting and packing problems
- A Dynamic Stochastic Stock-Cutting Problem
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
- A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape
- An Algorithm for Two-Dimensional Cutting Problems
- The cutting-wrapping problem in the textile industry: Optimal overlap of fabric lengths and defects for maximizing return based on quality
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- Two-Dimensional Guillotineable-Layout Cutting Problems with a Single Defect - An AND/OR-Graph Approach
- Adaptive Bin Packing with Overflow
- A stochastic programming approach to the cutting stock problem with usable leftovers
This page was built for publication: One-dimensional stock cutting resilient against singular random defects