Algorithms for nesting with defects
type: Item
instance of: scholarly article
title: Algorithms for nesting with defects
zbMATH Open document ID: 1303.90084
author: Roberto Baldacci
author: Maurizio Ganovelli
author: Vittorio Maniezzo
author: Marco A. Boschetti
published in: Discrete Applied Mathematics
publication date: 2014-09-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6341239
zbMATH Keywords: nesting problems
zbMATH Keywords: defected master
zbMATH Keywords: subgradient optimization
zbMATH Keywords: guided local search
describes a project that uses: TOPOS
MaRDI profile type: Publication
full work available at URL: j.dam.2012.03.026
OpenAlex ID: W2065009499
Wikidata QID: Q59195720
cites work: A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
cites work: The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
cites work: The geometry of nesting problems: a tutorial
cites work: A beam search implementation for the irregular shape packing problem
cites work: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: Using a tabu search approach for solving the two-dimensional irregular cutting problem
cites work: Benders decomposition, Lagrangean relaxation and metaheuristic design
cites work: The two-dimensional finite bin packing problem. II: New lower and upper bounds
cites work: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
cites work: Complete and robust no-fit polygon generation for the irregular stock cutting problem
cites work: Irregular Packing Using the Line and Arc No-Fit Polygon
cites work: Mathematical model and efficient algorithms for object packing problem
cites work: Solution approaches to irregular nesting problems
cites work: Jostling for position: local improvement for irregular cutting patterns
cites work: Fast neighborhood search for two- and three-dimensional nesting problems
cites work: Determining the minimum-area encasing rectangle for an arbitrary closed curve
cites work: A 2-exchange heuristic for nesting problems
cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
cites work: The nesting problem in the leather manufacturing industry
cites work: New approaches for the nesting of two-dimensional shapes for press tool design
cites work: On genetic algorithms for the packing of polygons
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: Applied simulated annealing
cites work: TOPOS -- A new constructive algorithm for nesting problems
cites work: \(\Phi\)-functions for complex 2D-objects
cites work: Guided Local Search
cites work: An improved typology of cutting and packing problems
DOI: 10.1016/J.DAM.2012.03.026
DBLP publication ID: journals/dam/BaldacciBGM14
description: scientific article; zbMATH DE number 6341239