Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
From MaRDI portal
Publication:2294074
Recommendations
- An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- An algorithm for the 2D guillotine cutting stock problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
Cites work
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- An agent-based approach to the two-dimensional guillotine bin packing problem
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Evolutionary Computation in Combinatorial Optimization
- Exact algorithms for the two-dimensional guillotine knapsack
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Exact solution of the two-dimensional finite bin packing problem
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- Models and algorithms for three-stage two-dimensional bin packing
- Multistage Cutting Stock Problems of Two and More Dimensions
- Polyhedral Characterization of Discrete Dynamic Programming
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Recent advances on two-dimensional bin packing problems
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
Cited in
(2)
This page was built for publication: Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294074)
