On the two-dimensional knapsack problem
From MaRDI portal
Recommendations
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Exact algorithms for the two-dimensional guillotine knapsack
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact approach to the strip-packing problem
- Exact solution of the two-dimensional finite bin packing problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- New classes of fast lower bounds for bin packing problems
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
Cited in
(59)- Packing problems in space solved by CPLEX: an experimental analysis
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- 2D knapsack: packing squares
- scientific article; zbMATH DE number 4160465 (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?)
- Approximation algorithms for orthogonal packing problems for hypercubes
- The two-dimensional bin packing problem with variable bin sizes and costs
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- Minimum tiling of a rectangle by squares
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Exact algorithms for the two-dimensional guillotine knapsack
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- Exact solution techniques for two-dimensional cutting and packing
- MPQ-trees for the orthogonal packing problem
- Conservative scales in packing problems
- Approximation and online algorithms for multidimensional bin packing: a survey
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- Two-dimensional knapsack-block packing problem
- An EDA for the 2D knapsack problem with guillotine constraint
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Online removable square packing
- Bidimensional packing by bilinear programming
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- A quasi-PTAS for the two-dimensional geometric knapsack problem
- An improved typology of cutting and packing problems
- MPQ-trees for orthogonal packing problem
- A note on a two dimensional knapsack problem with unloading constraints
- A new heuristic recursive algorithm for the strip rectangular packing problem
- 2D knapsack: packing squares
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- On the rectangular knapsack problem
- Tight complexity bounds for the two-dimensional real knapsack problem
- Heuristics for container loading of furniture
- Modeling two-dimensional guillotine cutting problems via integer programming
- Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
- Fast heuristic for constrained homogenous T-shape cutting patterns
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- The off-line group seat reservation problem
- A new constraint programming approach for the orthogonal packing problem
- The three-dimensional knapsack problem with balancing constraints
- scientific article; zbMATH DE number 444958 (Why is no real title available?)
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
This page was built for publication: On the two-dimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433651)
