Local search of orthogonal packings using the lower bounds
type: Item
instance of: scholarly article
title: Local search of orthogonal packings using the lower bounds
zbMATH Open document ID: 1181.93011
DOI: 10.1134/S0005117909060113
author: M. A. Mesyagutov
author: E. A. Mukhacheva
author: A. S. Filippova
author: V. M. Kartak
published in: Automation and Remote Control
publication date: 2009-11-24T00:00:00Z
Mathematics Subject Classification ID: 93A30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5637674
zbMATH Keywords: packing the rectangular half-infinite strip
zbMATH Keywords: evolutionary algorithm
zbMATH Keywords: one-dimensional cutting
MaRDI profile type: Publication
cites work: Recent advances on two-dimensional bin packing problems
cites work: Comparison of certain evolutionary algorithms
cites work: An application of simulated annealing to the cutting stock problem
cites work: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
cites work: Design of rectangular packings using decoders of block structure
cites work: The rectangular packing problem: local optimum search methods based on block structures
cites work: One-dimensional heuristics adapted for two-dimensional rectangular strip packing
cites work: Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: Exact solution of the two-dimensional finite bin packing problem
full work available at URL: s0005117909060113
OpenAlex ID: W2038567431
description: scientific article; zbMATH DE number 5637674