A new exact algorithm for general orthogonal d-dimensional knapsack problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1264415
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Exact methods for the knapsack problem and its generalizations
- Approximating the Orthogonal Knapsack Problem for Hypercubes
- Some new results on multi-dimension Knapsack problem
- An efficient algorithm for multi-dimensional nonlinear knapsack problems
- A new exact algorithm for concave knapsack problems with integer variables
- Approximation Algorithms for 3D Orthogonal Knapsack
- An exact algorithm for large multiple knapsack problems
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
Cited in
(28)- Two-dimensional knapsack-block packing problem
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A two-phase constructive algorithm for the single container mix-loading problem
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- Exact algorithms for the two-dimensional guillotine knapsack
- Characterization and modelling of guillotine constraints
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- On the two-dimensional knapsack problem
- An improved typology of cutting and packing problems
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- An EDA for the 2D knapsack problem with guillotine constraint
- A population heuristic for constrained two-dimensional non-guillotine cutting
- 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
- The three-dimensional knapsack problem with balancing constraints
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- Constraints in container loading -- a state-of-the-art review
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- scientific article; zbMATH DE number 1264415 (Why is no real title available?)
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
- Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- scientific article; zbMATH DE number 1183280 (Why is no real title available?)
This page was built for publication: A new exact algorithm for general orthogonal d-dimensional knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826081)
