An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
From MaRDI portal
Publication:5058727
DOI10.1080/0305215X.2017.1315571MaRDI QIDQ5058727
Wijak Srisujjalertwaja, Jeerayut Chaijaruwanich, Prakarn Unachak, Kanokwatt Shiangjen, Samerkae Somhom
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Related Items (4)
An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Rectangle packing with a recursive pilot method ⋮ The maximum diversity assortment selection problem
Cites Work
- A simple randomized algorithm for two-dimensional strip packing
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- Exact algorithms for the guillotine strip cutting/packing problem.
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- An Exact Approach to the Strip-Packing Problem
- Shelf Algorithms for Two-Dimensional Packing Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Combinatorial optimization. Theory and algorithms.
- Data set generation for rectangular placement problems
This page was built for publication: An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem
