A Parallel Nash Genetic Algorithm for the 3D Orthogonal Knapsack Problem
The Three-Dimensional Knapsack Packing Problem consists of finding the maximum profit for packing a subset of boxes in a larger box (packing box). The boxes to pack are rectangular but of different sizes. This problem is a variant of the Knapsack Problem and therefore its computational complexity is...
Saved in:
| Published in: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Language: | Inglês |
| Published: |
International Journal of Combinatorial Optimization Problems and Informatics
2013
|
| Subjects: | |
| Online Access: | https://www.redalyc.org/articulo.oa?id=265229639001 |
| Tags: |
No Tags, Be the first to tag this record!
|