Searching for "On the two-dimensional Knapsack Problem." – sorted by Relevance.
-
A GA-based Heuristic for the Interrelated Container Selection Loading Problems
- selection and loading problems. The GA for container selection solves a two-dimensional knapsack problem
- Add To MetaCart
-
Approximating the orthogonal knapsack problem for hypercubes
- (squares instead of rectangles in the two-dimensional case) and investigate how much easier the problem
- Cited by 3 (1 self) – Add To MetaCart
-
A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
- knapsack problem The two-dimensional Knapsack Problem (2KP), whose input consists of a set N={1,…,n
- Cited by 1 (0 self) – Add To MetaCart
-
On the Number of Vertices in Integer Linear Programming Problems
- and Shevchenko [11] also investigated the two-dimensional knapsack problem. For naturals a; b; c, we denote by N
- Cited by 2 (0 self) – Add To MetaCart
-
orthogonal packing problem
- algorithms based on the natural relaxation of the two-dimensional knapsack problem. In the relaxation
- Add To MetaCart
-
Multi-winner elections: Complexity of manipulation, control and winner-determination
- Multidimensional Knapsack. Push essentially solves a special case of the two-dimensional knapsack problem, where
- Cited by 10 (3 self) – Add To MetaCart
-
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- of an optimal packing. More recent work by Caprara and Monaci (2004) [6] on the two-dimensional knapsack problem
- Cited by 9 (1 self) – Add To MetaCart

