New stabilization procedures for the cutting stock problem
From MaRDI portal
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
(14)- New cases of the cutting stock problem having MIRUP
- Stability analysis for a special interval cutting problem
- Exact algorithms for the bin packing problem with fragile objects
- Conservative scales in packing problems
- An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem
- Accelerating column generation for variable sized bin-packing problems
- Dual inequalities for stabilized column generation revisited
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- On the cutting stock problem under stochastic demand
- Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation
- Last fifty years of integer linear programming: a focus on recent practical advances
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Theoretical investigations on maximal dual feasible functions
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)
