An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
From MaRDI portal
Publication:1388926
DOI10.1016/0377-2217(93)E0277-5zbMath0903.90134OpenAlexW2084643394MaRDI QIDQ1388926
Nicos Christofides, Eleni Hadjiconstantinou
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0277-5
Related Items
MPQ-trees for orthogonal packing problem, Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem, Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns, A hybrid genetic algorithm for the two-dimensional single large object placement problem, An integrated cutting stock and sequencing problem, Packing into the smallest square: worst-case analysis of lower bounds, Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem, Optimizing Squares Covering a Set of Points, Bun splitting: a practical cutting stock problem, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, An introduction to the two‐dimensional rectangular cutting and packing problem, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, MPQ-trees for the orthogonal packing problem, Keep your distance: land division with separation, An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, On the two-dimensional knapsack problem, An enumeration scheme to generate constrained exact checkerboard patterns, Two-dimensional knapsack-block packing problem, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Improved state space relaxation for constrained two-dimensional guillotine cutting problems, Optimizing squares covering a set of points, Fast heuristic for constrained homogenous T-shape cutting patterns, Exact algorithms for the two-dimensional guillotine knapsack, Recent advances on two-dimensional bin packing problems, Consecutive ones matrices for multi-dimensional orthogonal packing problems, A new heuristic recursive algorithm for the strip rectangular packing problem, Lower bounds from state space relaxations for concave cost network flow problems, A note on linear models for two-group and three-group two-dimensional guillotine cutting problems, Exact solution techniques for two-dimensional cutting and packing, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, Heuristics for packing semifluids, Consecutive ones matrices for multi-dimensional orthogonal packing problems, A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, A recursive algorithm for constrained two-dimensional cutting problems, Linear models for 1-group two-dimensional guillotine cutting problems, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems, A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting, Unnamed Item, Two-dimensional packing problems: a survey, An effective quasi-human based heuristic for solving the rectangle packing problem, Strip based compact formulation for two-dimensional guillotine cutting problems
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