A population heuristic for constrained two-dimensional non-guillotine cutting
type: Item
instance of: scholarly article
title: A population heuristic for constrained two-dimensional non-guillotine cutting
zbMATH Open document ID: 1056.90011
DOI: 10.1016/S0377-2217(03)00139-5
published in: European Journal of Operational Research
publication date: 2004-08-19T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2093027
zbMATH Keywords: Constrained two-dimensional non-guillotine cutting
zbMATH Keywords: Population heuristic
author: J. E. Beasley
describes a project that uses: OR-Library
MaRDI profile type: Publication
cites work: An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
cites work: Q5687948
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Obtaining test problems via Internet
cites work: Handbook of applied optimization
cites work: A genetic algorithm for the set covering problem
cites work: An evolutionary heuristic for the index tracking problem.
cites work: Scheduling aircraft landings at London Heathrow using a population heuristic
cites work: Heuristics for cardinality constrained portfolio optimization
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: A genetic algorithm for the generalised assignment problem
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Constraint handling in genetic algorithms: the set partitioning problem
cites work: Packing problems
cites work: A typology of cutting and packing problems
cites work: A new exact algorithm for general orthogonal d-dimensional knapsack problems
cites work: An exact algorithm for general, orthogonal, two-dimensional knapsack problems
cites work: Cutting stock problems and solution procedures
cites work: An optimal algorithm for rectangle placement
cites work: Q4079017
cites work: On genetic algorithms for the packing of polygons
cites work: Q4495496
cites work: Feature Article—Genetic Algorithms for the Operations Researcher
cites work: Modeling of packing problems
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
cites work: An effective quasi-human based heuristic for solving the rectangle packing problem
description: scientific article; zbMATH DE number 2093027