A New Linear Programming Approach to the Cutting Stock Problem
From MaRDI portal
Cited in
(55)- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- Exact solution techniques for two-dimensional cutting and packing
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Cutting optimization of structural tubes to build agricultural light aircrafts
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- A bay design problem in less-than-unit-load production warehouse
- Strip based compact formulation for two-dimensional guillotine cutting problems
- The generalized assortment and best cutting stock length problems
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- New symmetry-less ILP formulation for the classical one dimensional bin-packing problem
- Mathematical models and decomposition methods for the multiple knapsack problem
- Classification and literature review of integrated lot-sizing and cutting stock problems
- An approach to two-dimensional cutting stock problems
- Composite stock cutting through simulated annealing
- Modeling two-dimensional guillotine cutting problems via integer programming
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
- An introduction to stochastic bin packing-based server consolidation with conflicts
- LP models for bin packing and cutting stock problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- The stochastic trim-loss problem
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
- Bin packing with thresholds: mathematical models and theoretical results
- Integer linear programming models for the skiving stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- An algorithm for the two-dimensional assortment problem
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- An improved typology of cutting and packing problems
- A note on handling residual lengths
- The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- Heuristics for packing semifluids
- A Heuristic Solution of a Cutting Problem Using Hypergraphs
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Mathematical models and approximate solution approaches for the stochastic bin packing problem
- Theoretical analysis of integer programming models for the two-dimensional two-staged knapsack problem
- Knowledge based approach to the cutting stock problem
- Extending the reflect flow formulation to variable-sized one-dimensional cutting and skiving stock problems
- Optimal solutions for the cutting stock problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- An integrated cutting stock and sequencing problem
- BPPLIB: a library for bin packing and cutting stock problems
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
- Analysis and modelling of a production line in a corrugated box factory
This page was built for publication: A New Linear Programming Approach to the Cutting Stock Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3929394)
