Glass cutting in a small firm
From MaRDI portal
Publication:4189048
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
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
Cited in
(18)- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- Establishing the optimality of sequencing heuristics for cutting stock problems
- Limiting the number of each piece in two-dimensional cutting stock patterns
- Knowledge based approach to the cutting stock problem
- Heuristic and exact methods for the cutting sequencing problem
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- The cutting stock problem in the canvas industry
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process
- An integrated cutting stock and sequencing problem
- Heuristic methods to consecutive block minimization
- Iterated local search for consecutive block minimization
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- Exploiting packing components in general-purpose integer programming solvers
- Exponential neighborhood search for consecutive block minimization
- Mathematical models for the minimization of open stacks problem
- Solving two-dimensional cutting stock problem via a DNA computing algorithm
- Models for two-dimensional bin packing problems with customer order spread
- Heuristics for sequencing cutting patterns
This page was built for publication: Glass cutting in a small firm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189048)
