An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
From MaRDI portal
Recommendations
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Bounds for Two-Dimensional Cutting
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
Cited in
(only showing first 100 items - show all)- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A branch and bound algorithm for the strip packing problem
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- An application of simulated annealing to the cutting stock problem
- Regular packing of congruent polygons on the rectangular sheet
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Packing different-sized circles into a rectangular container
- An analytical model for the container loading problem
- Cutting stock problems and solution procedures
- Composite stock cutting through simulated annealing
- Knowledge based approach to the cutting stock problem
- Packing problems
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- A recursive exact algorithm for weighted two-dimensional cutting
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- On the effectivity of gradient methods for cutting stock problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- A method for the cutting stock problem with different qualities
- On the two-dimensional knapsack problem
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- Logic based Benders' decomposition for orthogonal stock cutting problems
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- Integer programming formulations for approximate packing circles in a rectangular container
- Minimum tiling of a rectangle by squares
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- MIP-based approaches for the container loading problem with multi-drop constraints
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Three-dimensional container loading models with cargo stability and load bearing constraints
- An efficient deterministic heuristic for two-dimensional rectangular packing
- A branch-and-cut algorithm for the pallet loading problem
- Approximation algorithm for the oriented two-dimensional bin packing problem
- An exact algorithm for the pallet loading problem
- Efficient automated pallet loading
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- Load planning for shipments of low density products
- Two-dimensional packing problems: a survey
- LP models for bin packing and cutting stock problems
- An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- A simulated annealing approach for the circular cutting problem
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Efficient heuristics for robot acquisition planning for a CIM system
- MPQ-trees for the orthogonal packing problem
- Symmetry-breaking constraints for packing identical rectangles within polyhedra
- Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement
- Two-dimensional knapsack-block packing problem
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
- Exact solution techniques for two-dimensional cutting and packing
- Queue-constrained packing: a vehicle ferry case study
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- The maximum diversity assortment selection problem
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
- The exact solutions of several types of container loading problems
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- A two-phase approach for single container loading with weakly heterogeneous boxes
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- An EDA for the 2D knapsack problem with guillotine constraint
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems
- A new heuristic recursive algorithm for the strip rectangular packing problem
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- An improved typology of cutting and packing problems
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- An integrated cutting stock and sequencing problem
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- The pallet loading problem: a review of solution methods and computational experiments
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
- A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
- An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
- MPQ-trees for orthogonal packing problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- Metaheuristics for truck loading in the car production industry
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- On the three-dimensional container packing problem under home delivery service
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- Bounds for Two-Dimensional Cutting
- The pallet packing problem for non-uniform box sizes
- A simple randomized algorithm for two-dimensional strip packing
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
This page was built for publication: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686413)
