An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (Q5058727): Difference between revisions

Latest revision as of 04:35, 31 July 2024

scientific article; zbMATH DE number 7636603

Language	Label	Description	Also known as
English	An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem	scientific article; zbMATH DE number 7636603

Statements

instance of

scholarly article

0 references

title

An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem (English)

0 references

author

Kanokwatt Shiangjen

0 references

Jeerayut Chaijaruwanich

0 references

Wijak Srisujjalertwaja

0 references

Prakarn Unachak

0 references

Samerkae Somhom

0 references

published in

Engineering Optimization

0 references

publication date

23 December 2022

0 references

zbMATH Keywords

optimization

0 references

heuristic

0 references

iterated local search

0 references

two-dimensional knapsack packing

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Shelf Algorithms for Two-Dimensional Packing Problems

0 references

Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

0 references

An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure

0 references

A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

0 references

An Algorithm for Two-Dimensional Cutting Problems

0 references

Heuristic approaches for the two- and three-dimensional knapsack packing problem

0 references

Exact algorithms for the guillotine strip cutting/packing problem.

0 references

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

0 references

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

0 references

Combinatorial optimization. Theory and algorithms.

0 references

A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

0 references

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

0 references

An Exact Approach to the Strip-Packing Problem

0 references

An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem

0 references

Data set generation for rectangular placement problems

0 references

A least wasted first heuristic algorithm for the rectangular packing problem

0 references

An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem

0 references

A simple randomized algorithm for two-dimensional strip packing

0 references

Identifiers

DOI

10.1080/0305215X.2017.1315571

0 references

Mathematics Subject Classification ID

90-XX

0 references

zbMATH DE Number

7636603

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5058727

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Shelf Algorithms for Two-Dimensional Packing Problems
+Normal rank
@@ Property / cites work @@
+Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
+Normal rank
@@ Property / cites work @@
+An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
+Normal rank
@@ Property / cites work @@
+A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for Two-Dimensional Cutting Problems
@@ Property / cites work: An Algorithm for Two-Dimensional Cutting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic approaches for the two- and three-dimensional knapsack packing problem
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the guillotine strip cutting/packing problem.
+Normal rank
@@ Property / cites work @@
+An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
+Normal rank
@@ Property / cites work @@
+The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
+Normal rank
@@ Property / cites work @@
+Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
+Normal rank
@@ Property / cites work @@
+An Exact Approach to the Strip-Packing Problem
@@ Property / cites work: An Exact Approach to the Strip-Packing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
+Normal rank
@@ Property / cites work @@
+Data set generation for rectangular placement problems
+Normal rank
@@ Property / cites work @@
+A least wasted first heuristic algorithm for the rectangular packing problem
+Normal rank
@@ Property / cites work @@
+An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
+Normal rank
@@ Property / cites work @@
+A simple randomized algorithm for two-dimensional strip packing
+Normal rank