A 2-exchange heuristic for nesting problems
type: Item
instance of: scholarly article
title: A 2-exchange heuristic for nesting problems
zbMATH Open document ID: 1081.90611
DOI: 10.1016/S0377-2217(02)00130-3
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1829889
zbMATH Keywords: Cutting
zbMATH Keywords: Packing
zbMATH Keywords: Heuristics
zbMATH Keywords: Nesting
describes a project that uses: TOPOS
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Using a tabu search approach for solving the two-dimensional irregular cutting problem
cites work: Jostling for position: local improvement for irregular cutting patterns
cites work: An algorithm for polygon placement using a bottom-left strategy
cites work: Compaction and separation algorithms for non-convex polygons and their applications
cites work: TOPOS -- A new constructive algorithm for nesting problems
full work available at URL: s0377-2217(02)00130-3
OpenAlex ID: W2106783129
description: scientific article; zbMATH DE number 1829889