Matches in DBpedia 2016-04 for { ?s ?p "In the bin packing problem, objects of different volumes must be packed into a finite number of bins or containers each of volume V in a way that minimizes the number of bins used. In computational complexity theory, it is a combinatorial NP-complete problem.There are many variations of this problem, such as 2D packing, linear packing, packing by weight, packing by cost, and so on."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Bin_packing_problem comment "In the bin packing problem, objects of different volumes must be packed into a finite number of bins or containers each of volume V in a way that minimizes the number of bins used. In computational complexity theory, it is a combinatorial NP-complete problem.There are many variations of this problem, such as 2D packing, linear packing, packing by weight, packing by cost, and so on.".
- Q814581 comment "In the bin packing problem, objects of different volumes must be packed into a finite number of bins or containers each of volume V in a way that minimizes the number of bins used. In computational complexity theory, it is a combinatorial NP-complete problem.There are many variations of this problem, such as 2D packing, linear packing, packing by weight, packing by cost, and so on.".