An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
type: Item
instance of: scholarly article
title: An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
zbMATH Open document ID: 1391.90538
author: Lijun Wei
author: Qian Hu
author: Stephen C. H. Leung
author: Ning Zhang
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6901363
zbMATH Keywords: cutting
zbMATH Keywords: packing
zbMATH Keywords: heuristics
zbMATH Keywords: random local search
zbMATH Keywords: best-fit
MaRDI profile type: Publication
full work available at URL: j.cor.2016.11.024
OpenAlex ID: W2558364177
cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
cites work: An improved typology of cutting and packing problems
cites work: Exact algorithms for the guillotine strip cutting/packing problem.
cites work: An exact approach to the strip-packing problem
cites work: Exact algorithms for the two-dimensional strip packing problem with and without rotations
cites work: An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
cites work: LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
cites work: Combinatorial Benders' Cuts for the Strip Packing Problem
cites work: Orthogonal Packings in Two Dimensions
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
cites work: A new heuristic recursive algorithm for the strip rectangular packing problem
cites work: A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
cites work: Bidirectional best-fit heuristic for orthogonal rectangular strip packing
cites work: An improved best-fit heuristic for the orthogonal strip packing problem
cites work: A least wasted first heuristic algorithm for the rectangular packing problem
cites work: An effective quasi-human based heuristic for solving the rectangle packing problem
cites work: A skyline heuristic for the 2D rectangular packing and strip packing problems
cites work: An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
cites work: A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
cites work: A simple randomized algorithm for two-dimensional strip packing
cites work: An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
cites work: Reactive GRASP for the strip-packing problem
cites work: The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: Data set generation for rectangular placement problems
cites work: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
DOI: 10.1016/J.COR.2016.11.024
description: scientific article; zbMATH DE number 6901363