New stabilization procedures for the cutting stock problem
From MaRDI portal
Publication:2899145
Recommendations
- Cutting Stock Problems
- Using extra dual cuts to accelerate column generation
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Dual-Optimal Inequalities for Stabilized Column Generation
- Solving binary cutting stock problems by column generation and branch- and-bound
Cited in
(13)- On the cutting stock problem under stochastic demand
- Conservative scales in packing problems
- Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Exact algorithms for the bin packing problem with fragile objects
- New cases of the cutting stock problem having MIRUP
- Dual inequalities for stabilized column generation revisited
- Accelerating column generation for variable sized bin-packing problems
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Theoretical investigations on maximal dual feasible functions
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- Stability analysis for a special interval cutting problem
This page was built for publication: New stabilization procedures for the cutting stock problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899145)
