The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (Q732899): Difference between revisions

Latest revision as of 02:02, 2 July 2024

scientific article

Language	Label	Description	Also known as
English	The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio	scientific article

Statements

instance of

scholarly article

0 references

title

The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio (English)

0 references

zbMATH Open document ID

1175.90429

0 references

DOI

10.1016/j.cor.2009.05.008

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

15 October 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

cutting and packing

0 references

rectangular strip packing

0 references

best-fit heuristic

0 references

time complexity

0 references

approximation ratio

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2009.05.008

0 references

OpenAlex ID

W2003153490

0 references

cites work

Reactive GRASP for the strip-packing problem

0 references

Orthogonal Packings in Two Dimensions

0 references

A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces

0 references

A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

0 references

A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem

0 references

The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation

0 references

Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

0 references

A typology of cutting and packing problems

0 references

Q4198056

0 references

An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

0 references

Improved local search algorithms for the rectangle packing problem with general spatial costs

0 references

On genetic algorithms for the packing of polygons

0 references

On strip packing With rotations

0 references

A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

0 references

Q4349924

0 references

An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles

0 references

Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

0 references

Q4350159

0 references

A Strip-Packing Algorithm with Absolute Performance Bound 2

0 references

Data set generation for rectangular placement problems

0 references

An improved typology of cutting and packing problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:732899

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2009.05.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2003153490
@@ Property / OpenAlex ID: W2003153490 / rank @@
+Normal rank
@@ Property / cites work @@
+Reactive GRASP for the strip-packing problem
@@ Property / cites work: Reactive GRASP for the strip-packing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal Packings in Two Dimensions
@@ Property / cites work: Orthogonal Packings in Two Dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
+Normal rank
@@ Property / cites work @@
+A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
+Normal rank
@@ Property / cites work @@
+A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
+Normal rank
@@ Property / cites work @@
+The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
+Normal rank
@@ Property / cites work @@
+Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+A typology of cutting and packing problems
@@ Property / cites work: A typology of cutting and packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
+Normal rank
@@ Property / cites work @@
+Improved local search algorithms for the rectangle packing problem with general spatial costs
+Normal rank
@@ Property / cites work @@
+On genetic algorithms for the packing of polygons
@@ Property / cites work: On genetic algorithms for the packing of polygons / rank @@
+Normal rank
@@ Property / cites work @@
+On strip packing With rotations
@@ Property / cites work: On strip packing With rotations / rank @@
+Normal rank
@@ Property / cites work @@
+A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
+Normal rank
@@ Property / cites work @@
+Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
+Normal rank
@@ Property / cites work @@
+Q4350159
@@ Property / cites work: Q4350159 / rank @@
+Normal rank
@@ Property / cites work @@
+A Strip-Packing Algorithm with Absolute Performance Bound 2
+Normal rank
@@ Property / cites work @@
+Data set generation for rectangular placement problems
+Normal rank
@@ Property / cites work @@
+An improved typology of cutting and packing problems
+Normal rank