Knowledge based approach to the cutting stock problem
From MaRDI portal
Publication:1197096
DOI10.1016/0895-7177(92)90082-VzbMath0757.90068OpenAlexW2054695116MaRDI QIDQ1197096
Publication date: 16 January 1993
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(92)90082-v
Related Items
Metaheuristics: A bibliography ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
Cites Work
- The computer as an aid to physical distribution management
- Fixed charge problems with identical fixed charges
- A subject bibliography of logic programming applications in control and decision support systems
- Production planning and scheduling for an integrated container company
- The cutting stock problem for large sections in the iron and steel industries
- An instance of the cutting stock problem for which the rounding property does not hold
- A heuristic approach to one-dimensional cutting stock problem
- A solution comparison for dual angular linear programs
- Near-optimal solutions to one-dimensional cutting stock problems
- 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
- A 2.5 times optimal algorithm for packing in two dimensions
- Optimal and canonical solutions of the change making problem
- The trim-loss and assortment problems: A survey
- Heuristic algorithms for the multiple knapsack problem
- Lower bounds for on-line two-dimensional packing algorithms
- Lumber production optimization
- Wastage reduction in wood cutting
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- A note on the Martello-Toth algorithm for one-dimensional knapsack problems
- The Trim Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Shelf Algorithms for Two-Dimensional Packing Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- The cutting stock problem and integer rounding
- Variable Sized Bin Packing
- An approach to two-dimensional cutting stock problems
- Polygon containment under translation
- Nonorthogonal Two-Dimensional Cutting Patterns
- An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
- An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
- Selection and Design of Heuristic Procedures for Solving Roll Trim Problems
- Polygon placement under translation and rotation
- Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
- Orthogonal Packings in Two Dimensions
- A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape
- Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
- A algorithm for two-dimensional packing
- A New Linear Programming Approach to the Cutting Stock Problem
- AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- The Change-Making Problem
- A Solution of the Rectangular Cutting-Stock Problem
- An Algorithm for Two-Dimensional Cutting Problems
- A Frequency Approach to the One-dimensional Cutting Problem for Carpet Rolls
- A Note on the Two-Dimensional Rectangular Cutting-Stock Problem
- Glass cutting in a small firm
- Equation of State Calculations by Fast Computing Machines
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- An Algorithm for Modular Partitioning
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
