An introduction to the two‐dimensional rectangular cutting and packing problem

Related Items

Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Bin packing and cutting stock problems: mathematical models and exact algorithms
Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
Bin packing and related problems: general arc-flow formulation with graph compression
A skyline heuristic for the 2D rectangular packing and strip packing problems
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
Recent advances on two-dimensional bin packing problems
A general framework for bounds for higher-dimensional orthogonal packing problems.
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
A least wasted first heuristic algorithm for the rectangular packing problem
An integer programming model for two- and three-stage two-dimensional cutting stock problems
An application of simulated annealing to the cutting stock problem
The trim-loss and assortment problems: A survey
An and-or-graph approach for two-dimensional cutting problems
Knowledge based approach to the cutting stock problem
Packing problems
Solution for the constrained Guillotine cutting problem by simulated annealing
On genetic algorithms for the packing of polygons
A recursive exact algorithm for weighted two-dimensional cutting
Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
Exact solution of bin-packing problems using column generation and branch-and-bound
An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
Integer linear programming models for 2-staged two-dimensional knapsack problems
The two-dimensional finite bin packing problem. II: New lower and upper bounds
An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
A comparative numerical analysis for the guillotine two-dimensional cutting problem
A review of the application of meta-heuristic algorithms to 2D strip packing problems
Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
Approximation algorithm for the oriented two-dimensional bin packing problem
An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
A typology of cutting and packing problems
Two-dimensional packing problems: a survey
Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings
Exact solution techniques for two-dimensional cutting and packing
A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
Approximation and online algorithms for multidimensional bin packing: a survey
A new constraint programming approach for the orthogonal packing problem
Strip generation algorithms for constrained two-dimensional two-staged cutting problems
Sequential heuristic for the two-dimensional bin-packing problem
An improved typology of cutting and 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 new exact method for the two-dimensional orthogonal packing problem
A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
Models and algorithms for three-stage two-dimensional bin packing
Arc-flow model for the two-dimensional guillotine cutting stock problem
The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
Exact Solution of the Two-Dimensional Finite Bin Packing Problem
The pallet loading problem: a review of solution methods and computational experiments
Guided Local Search for the Three-Dimensional Bin-Packing Problem
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem
Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS
A Linear Programming Approach to the Cutting-Stock Problem
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
Two-Dimensional Finite Bin-Packing Algorithms
Orthogonal Packings in Two Dimensions
On Packing Two-Dimensional Bins
Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
An Algorithm for Two-Dimensional Cutting Problems
A Note on the Two-Dimensional Rectangular Cutting-Stock Problem
Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
The Three-Dimensional Bin Packing Problem
A guide to vehicle routing heuristics
A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
The G4-Heuristic for the Pallet Loading Problem
New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
The Meet-in-the-Middle Principle for Cutting and Packing Problems
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Multistage Cutting Stock Problems of Two and More Dimensions
The Theory and Computation of Knapsack Functions
A Graph-Theoretic Approach to a Class of Integer-Programming Problems
Recursive Computational Procedure for Two-dimensional Stock Cutting
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
Computational Science - ICCS 2004
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
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

This page was built for publication: An introduction to the two‐dimensional rectangular cutting and packing problem