A method for the cutting stock problem with different qualities
From MaRDI portal
Recommendations
- One-dimensional cutting stock decisions for rolls with multiple quality grades
- Optimal solutions for the cutting stock problem
- An integrated cutting stock and sequencing problem
- Cutting stock problems and solution procedures
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
Cites work
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Validation of subgradient optimization
Cited in
(13)- Integrated defect detection and optimization for cross cutting of wooden boards
- GRASP for set packing problems.
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
- A hybrid evolutionary approach for set packing problem
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem
- scientific article; zbMATH DE number 3914058 (Why is no real title available?)
- Cutting and packing problems with placement constraints
- Mathematical and computational model for the efficient solution of two-dimensional (2D) material cutting problems using integer linear programming
- One-dimensional stock cutting resilient against singular random defects
- Bun splitting: a practical cutting stock problem
- The Strategic Design of Forest Industry Supply Chains
- Solving the set packing problem via a maximum weighted independent set heuristic
- Heuristic algorithms for visiting the customers in a rolling schedule environment
This page was built for publication: A method for the cutting stock problem with different qualities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388928)
