An Algorithm for Two-Dimensional Cutting Problems

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Search theory (90B40) Integer programming (90C10) Hamilton-Jacobi theories (49L99)

Cited In (only showing first 100 items - show all)

A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
Strip generation algorithms for constrained two-dimensional two-staged cutting problems
Stock cutting to minimize cutting length
Metaheuristics for vehicle routing problems with three-dimensional loading constraints
A linear optimization approach to the combined production planning model
An approach to two-dimensional cutting stock problems
A block-based layer building approach for the 2D guillotine strip packing problem
A skyline heuristic for the 2D rectangular packing and strip packing problems
Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
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
A simple randomized algorithm for two-dimensional strip packing
Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
Fast heuristic for constrained homogenous T-shape cutting patterns
Recent advances on two-dimensional bin packing problems
The nesting problem in the leather manufacturing industry
The cutting stock problem in a hardboard industry: A case study.
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
Exact algorithms for the two-dimensional guillotine knapsack
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
Heuristic approaches for the two- and three-dimensional knapsack packing problem
A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
A new constraint programming approach for the orthogonal packing problem
Computing stable loads for pallets
A recursive algorithm for constrained two-dimensional cutting problems
New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
The off-line group seat reservation problem
An effective tabu search approach with improved loading algorithms for the 3L-CVRP
Reactive GRASP for the strip-packing problem
A branch and bound algorithm for the strip packing problem
An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
Exact algorithms for the guillotine strip cutting/packing problem.
An improved typology of cutting and packing problems
On the two-dimensional knapsack problem
Packing problems
An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
An exact algorithm for general, orthogonal, two-dimensional knapsack problems
An analytical model for the container loading problem
The trim-loss and assortment problems: A survey
A branch-and-cut algorithm for the pallet loading 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 the pallet loading problem
Models and algorithms for packing rectangles into the smallest square
An improved version of Wang's algorithm for two-dimensional cutting problems
A population heuristic for constrained two-dimensional non-guillotine cutting
A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
The one dimensional Compartmentalised Knapsack problem: a case study
Fixed charge problems with identical fixed charges
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
Approximate algorithms for constrained circular cutting problems
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
Approximation algorithm for the oriented two-dimensional bin packing problem
A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
Multi-dimensional bin packing problems with guillotine constraints
A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
An efficient deterministic heuristic for two-dimensional rectangular packing
An exact algorithm for generating homogeneous T-shape cutting patterns
Corner occupying theorem for the two-dimensional integral rectangle packing problem
A hybrid metaheuristic for the two-dimensional strip packing problem
An and-or-graph approach for two-dimensional cutting problems
The solution of two-stage guillotine cutting stock problems having extremely varying order demands
A recursive exact algorithm for weighted two-dimensional cutting
The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
Solving the pallet loading problem
An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
Three-dimensional container loading models with cargo stability and load bearing constraints
An approximation algorithm for solving unconstrained two-dimensional knapsack problems
An enumeration scheme to generate constrained exact checkerboard patterns
Optimal solutions for the cutting stock problem
An integrated cutting stock and sequencing problem
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
A hybrid genetic algorithm for the two-dimensional single large object placement problem
A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
A new exact method for the two-dimensional orthogonal packing problem
A tabu search algorithm for a two-dimensional non-guillotine cutting problem
An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
Instance space analysis for 2D bin packing mathematical models
Two-dimensional knapsack-block packing problem
Sequential design with applications to the trim-loss problem
Exact solution techniques for two-dimensional cutting and packing
The exact solutions of several types of container loading problems
Mapping tree-structured combinatorial optimization problems onto parallel computers
Logistic constraints in container loading problems: the impact of complete shipment conditions
Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
Improved state space relaxation for constrained two-dimensional guillotine cutting problems
Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting
Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model

This page was built for publication: An Algorithm for Two-Dimensional Cutting Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146535)