An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
From MaRDI portal
Publication:1388926
DOI10.1016/0377-2217(93)E0277-5zbMath0903.90134MaRDI QIDQ1388926
Eleni Hadjiconstantinou, Nicos Christofides
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Linear models for 1-group two-dimensional guillotine cutting problems, A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, Recent advances on two-dimensional bin packing problems, Packing into the smallest square: worst-case analysis of lower bounds, A recursive algorithm for constrained two-dimensional cutting problems, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, On the two-dimensional knapsack problem, Two-dimensional packing problems: a survey, An effective quasi-human based heuristic for solving the rectangle packing problem, Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns, An enumeration scheme to generate constrained exact checkerboard patterns, A new heuristic recursive algorithm for the strip rectangular packing problem, Lower bounds from state space relaxations for concave cost network flow problems, A hybrid genetic algorithm for the two-dimensional single large object placement problem, An integrated cutting stock and sequencing problem, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
Uses Software
Cites Work
- A comparative study of heuristics for a two-level routing-location problem
- The trim-loss and assortment problems: A survey
- An improved version of Wang's algorithm for two-dimensional cutting problems
- A typology of cutting and packing problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Performance testing of rectangular parts-nesting heuristics
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- An Algorithm for Two-Dimensional Cutting Problems
- Validation of subgradient optimization
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- A Multistage Solution of the Template-Layout Problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
