On the two-dimensional knapsack problem
From MaRDI portal
Publication:1433651
DOI10.1016/S0167-6377(03)00057-9zbMath1056.90115MaRDI QIDQ1433651
Michele Monaci, Alberto Caprara
Publication date: 1 July 2004
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items
MPQ-trees for orthogonal packing problem, 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems, A hybrid evolutionary algorithm for the two-dimensional packing problem, Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, An improved typology of cutting and packing problems, PackLib\(^{2}\): an integrated library of multi-dimensional packing problems, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, 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, A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem, Approximation and online algorithms for multidimensional bin packing: a survey, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, 2D knapsack: packing squares, The off-line group seat reservation problem, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts, An EDA for the 2D knapsack problem with guillotine constraint, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, MPQ-trees for the orthogonal packing problem, A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, Conservative scales in packing problems, Maximizing revenue with allocation of multiple advertisements on a Web banner, An approximation scheme for the two-stage, two-dimensional knapsack problem, The three-dimensional knapsack problem with balancing constraints, Online removable square packing, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Minimum tiling of a rectangle by squares, A new constraint programming approach for the orthogonal packing problem, 2D Knapsack: Packing Squares, Two-dimensional knapsack-block packing problem, Heuristic approaches for the two- and three-dimensional knapsack packing problem, Fast heuristic for constrained homogenous T-shape cutting patterns, Exact algorithms for the two-dimensional guillotine knapsack, A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem, Consecutive ones matrices for multi-dimensional orthogonal packing problems, A new heuristic recursive algorithm for the strip rectangular packing problem, Grids for cutting and packing problems: a study in the 2D knapsack problem, Exact solution techniques for two-dimensional cutting and packing, Consecutive ones matrices for multi-dimensional orthogonal packing problems, Bidimensional packing by bilinear programming, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, Approximation algorithms for orthogonal packing problems for hypercubes, Heuristics for container loading of furniture, The two-dimensional bin packing problem with variable bin sizes and costs, Packing Problems in Space Solved by CPLEX: An Experimental Analysis, On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
Cites Work
- Unnamed Item
- Unnamed Item
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- 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
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- An Algorithm for Two-Dimensional Cutting Problems
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- New classes of fast lower bounds for bin packing problems
