A New Linear Programming Approach to the Cutting Stock Problem
From MaRDI portal
Publication:3929394
DOI10.1287/opre.29.6.1092zbMath0474.90059OpenAlexW2152147252MaRDI QIDQ3929394
Publication date: 1981
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.29.6.1092
one-dimensional cutting stock problemdynamic use of simply structured cutting patternslarge number of order lengths
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05) Production models (90B30)
Related Items
A note on handling residual lengths, 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, Cutting optimization of structural tubes to build agricultural light aircrafts, An introduction to stochastic bin packing-based server consolidation with conflicts, Integer linear programming models for the skiving stock problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, Practical adaptations of the Gilmore-Gomory approach to cutting stock problems, A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems, Models for the two-dimensional two-stage cutting stock problem with multiple stock size, An improved typology of cutting and packing problems, An integrated cutting stock and sequencing problem, The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production, An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem, Heuristics for the integer one-dimensional cutting stock problem: A computational study, An approach to two-dimensional cutting stock problems, Mathematical models and approximate solution approaches for the stochastic bin packing problem, Two dimensional guillotine cutting stock and scheduling problem in printing industry, 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, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case, The generalized assortment and best cutting stock length problems, Arc flow formulations based on dynamic programming: theoretical foundations and applications, BPPLIB: a library for bin packing and cutting stock problems, Composite stock cutting through simulated annealing, Knowledge based approach to the cutting stock problem, A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems, A Heuristic Solution of a Cutting Problem Using Hypergraphs, Mathematical models and decomposition methods for the multiple knapsack problem, Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation, 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, Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application, An integer programming model for two- and three-stage two-dimensional cutting stock problems, New symmetry-less ILP formulation for the classical one dimensional bin-packing problem, Exact solution techniques for two-dimensional cutting and packing, Classification and literature review of integrated lot-sizing and cutting stock problems, Heuristics for packing semifluids, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem, The stochastic trim-loss problem, An algorithm for the two-dimensional assortment problem, Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations, Optimal solutions for the cutting stock problem, The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming, LP models for bin packing and cutting stock problems, Strip based compact formulation for two-dimensional guillotine cutting problems
