An EDA for the 2D knapsack problem with guillotine constraint
From MaRDI portal
Publication:2418151
DOI10.1007/s10100-018-0551-xOpenAlexW2804981184MaRDI QIDQ2418151
Publication date: 3 June 2019
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-018-0551-x
Related Items (4)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Editorial ⋮ A hybrid evolutionary algorithm for the offline Bin Packing Problem
Cites Work
- Unnamed Item
- A block-based layer building approach for the 2D guillotine strip packing problem
- Heuristic for the rectangular strip packing problem with rotation of items
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- A recursive algorithm for constrained two-dimensional cutting problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Exact algorithms for the two-dimensional guillotine knapsack
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An effective quasi-human based heuristic for solving the rectangle packing problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Two Algorithms for Constrained Two-Dimensional Cutting Stock 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
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
This page was built for publication: An EDA for the 2D knapsack problem with guillotine constraint
