A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
From MaRDI portal
Recommendations
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Guillotineable bin packing: A genetic approach
- On the two-dimensional knapsack problem
- scientific article; zbMATH DE number 1728404
Cites work
- A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A hybrid genetic algorithm for the container loading problem
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- 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 empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An improved typology of cutting and packing problems
- 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
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Handbook of metaheuristics
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- On genetic algorithms for the packing of polygons
- On the two-dimensional knapsack problem
- Solution for the constrained Guillotine cutting problem by simulated annealing
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
Cited in
(19)- Two-dimensional knapsack-block packing problem
- An introduction to the two‐dimensional rectangular cutting and packing problem
- scientific article; zbMATH DE number 1728404 (Why is no real title available?)
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
- scientific article; zbMATH DE number 7656032 (Why is no real title available?)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- The maximum diversity assortment selection problem
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- An EDA for the 2D knapsack problem with guillotine constraint
- A joint replenishment problem considering multiple trucks with shipment and resource constraints
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- 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
- Heuristics for packing semifluids
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A modified partially mapped multicrossover genetic algorithm for two-dimensional bin packing problem
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
This page was built for publication: A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401326)
