Cutting stock problems and solution procedures
From MaRDI portal
one- and two-dimensional cutting stockpattern generationsequential heuristictrim losstwo-dimensional knapsack
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30) Linear programming (90C05) Combinatorial optimization (90C27)
Recommendations
Cites work
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A typology of cutting and packing problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An efficient implementation of an algorithm for findingK shortest simple paths
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Multistage Cutting Stock Problems of Two and More Dimensions
- Nonorthogonal Two-Dimensional Cutting Patterns
- One-dimensional cutting stock decisions for rolls with multiple quality grades
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- The Theory and Computation of Knapsack Functions
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
Cited in
(82)- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- An effective solution for a real cutting stock problem in manufacturing plastic rolls
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Strips minimization in two-dimensional cutting stock of circular items
- Near-optimal solutions to one-dimensional cutting stock problems
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- A sequential heuristic procedure for one-dimensional cutting
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Packing different-sized circles into a rectangular container
- Limiting the number of each piece in two-dimensional cutting stock patterns
- Knowledge based approach to the cutting stock problem
- A simulated annealing heuristic for the one-dimensional cutting stock problem
- Determining cutting stock patterns when defects are present
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
- Random search in the one-dimensional cutting stock problem
- Setup minimising conditions in the trim loss problem
- New cases of the cutting stock problem having MIRUP
- A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
- Solving binary cutting stock problems by column generation and branch- and-bound
- Solution procedures for cutting lumber into furniture parts
- Procedures for solving a 1-dimensional cutting problem
- An interactive technique for the cutting stock problem with multiple objectives
- On the effectivity of gradient methods for cutting stock problems
- Optimization of roll cutting in clothing industry
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- A method for the cutting stock problem with different qualities
- Improving competitiveness in veneers production by a simple-to-use DSS.
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Improving blood products supply through donation tailoring
- Two-dimensional cutting stock problem with sequence dependent setup times
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- Optimal and heuristic solutions for a scheduling problem arising in a foundry
- A hybrid approach for optimization of one-dimensional cutting
- Wastage reduction in wood cutting
- Knowledge-based systems for cutting stock problems
- One-dimensional cutting stock decisions for rolls with multiple quality grades
- The cutting stock problem in the canvas industry
- An LP-based approach to cutting stock problems with multiple objectives
- A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry
- An effective quasi-human based heuristic for solving the rectangle packing problem
- One-dimensional cutting stock problem to minimize the number of different patterns
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A simulated annealing approach to the nesting problem in the textile manufacturing industry
- Interactive procedures in large-scale two-dimensional cutting stock problems
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- A branch-and-price algorithm for the temporal bin packing problem
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Solving a combined cutting-stock and lot-sizing problem with a column generating procedure
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- An integrated cutting stock and sequencing problem
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A grouping method for solving a continuous linear cutting stock problem
- scientific article; zbMATH DE number 444980 (Why is no real title available?)
- A matching approach for replenishing rectangular stock sizes
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- scientific article; zbMATH DE number 3891135 (Why is no real title available?)
- scientific article; zbMATH DE number 4199966 (Why is no real title available?)
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- Optimal job splitting on a multi-slot machine with applications in the printing industry
- scientific article; zbMATH DE number 3954634 (Why is no real title available?)
- scientific article; zbMATH DE number 4029242 (Why is no real title available?)
- scientific article; zbMATH DE number 4055375 (Why is no real title available?)
- An investigation into two bin packing problems with ordering and orientation implications
- An algorithm for a cutting stock problem on a strip
- scientific article; zbMATH DE number 1179834 (Why is no real title available?)
- A tree-search method for solving a cutting stock assignment problem
- Multi-job Cutting Stock Problem with Due Dates and Release Dates
- Development of some cutting stock algorithms
- The sequential value correction method for the two-dimensional irregular cutting stock problem
- A cutting stock problem in the wood products industry: a two‐stage solution approach
- Mathematical optimisation in the honeycomb cardboard industry: a model for the two-dimensional variable-sized cutting stock problem
- Enforcing minimum run length in the cutting stock problem
- Solving circle packing problems by global optimization: numerical results and industrial applications
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
This page was built for publication: Cutting stock problems and solution procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178994)
