An EDA for the 2D knapsack problem with guillotine constraint
From MaRDI portal
Publication:2418151
Recommendations
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Exact algorithms for the two-dimensional guillotine knapsack
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- Guillotineable bin packing: A genetic approach
Cites work
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A recursive algorithm for constrained two-dimensional cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An effective quasi-human based heuristic for solving the rectangle packing problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Exact algorithms for the two-dimensional guillotine knapsack
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- Heuristic for the rectangular strip packing problem with rotation of items
- scientific article; zbMATH DE number 1754723 (Why is no real title available?)
- On the two-dimensional knapsack problem
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
Cited in
(8)- A hybrid evolutionary algorithm for the offline Bin Packing Problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Editorial
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
- EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
- Tight approximation algorithms for 2D guillotine strip packing
- On guillotine separable packings for the two-dimensional geometric knapsack problem
This page was built for publication: An EDA for the 2D knapsack problem with guillotine constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2418151)
