A method for the cutting stock problem with different qualities

DOI10.1016/0377-2217(94)00023-6zbMath0903.90136OpenAlexW2093579978MaRDI QIDQ1388928

Mikael Rönnqvist

Publication date: 11 June 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00023-6

zbMATH Keywords

optimizationinteger programmingrelaxationdecision support systemset packingcuttingwooden boards

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)

Related Items

Solving the set packing problem via a maximum weighted independent set heuristic, Heuristic algorithms for visiting the customers in a rolling schedule environment, An evolutionary algorithm based hyper-heuristic framework for the set packing problem, Bun splitting: a practical cutting stock problem, One-dimensional stock cutting resilient against singular random defects, The Strategic Design of Forest Industry Supply Chains, GRASP for set packing problems., Cutting and Packing Problems with Placement Constraints, A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints, Integrated defect detection and optimization for cross cutting of wooden boards, Unnamed Item, A hybrid evolutionary approach for set packing problem

Cites Work

• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Validation of subgradient optimization
• Unnamed Item
• Unnamed Item