Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Packing_problem> ?p ?o. }
Showing items 1 to 39 of
39
with 100 items per page.
- Packing_problem abstract "Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap.In a packing problem, you are given: 'containers' (usually a single two- or three-dimensional convex region, or an infinite space) A set of 'objects' some or all of which must be packed into one or more containers. The set may contain different objects with their sizes specified, or a single object of a fixed dimension that can be used repeatedly.Usually the packing must be without overlaps between goods and other goods or the container walls. In some variants, the aim is to find the configuration that packs a single container with the maximal density. More commonly, the aim is to pack all the objects into as few containers as possible. In some variants the overlapping (of objects with each other and/or with the boundary of the container) is allowed but should be minimized.".
- Packing_problem thumbnail Circle_packing_(hexagonal).svg?width=300.
- Packing_problem wikiPageExternalLink CircleChallenge.
- Packing_problem wikiPageExternalLink BoxPacking.
- Packing_problem wikiPageExternalLink overview.
- Packing_problem wikiPageExternalLink Packing.html.
- Packing_problem wikiPageExternalLink SquarePacking.html.
- Packing_problem wikiPageExternalLink rectanglepacker.aspx.
- Packing_problem wikiPageExternalLink www.packomania.com.
- Packing_problem wikiPageExternalLink packing.html.
- Packing_problem wikiPageID "213003".
- Packing_problem wikiPageRevisionID "604725254".
- Packing_problem hasPhotoCollection Packing_problem.
- Packing_problem title "Klarner's Theorem".
- Packing_problem title "de Bruijn's Theorem".
- Packing_problem urlname "KlarnersTheorem".
- Packing_problem urlname "deBruijnsTheorem".
- Packing_problem subject Category:Packing_problem.
- Packing_problem type Abstraction100002137.
- Packing_problem type Attribute100024264.
- Packing_problem type Communication100033020.
- Packing_problem type Condition113920835.
- Packing_problem type Difficulty114408086.
- Packing_problem type MathematicalProblems.
- Packing_problem type Message106598915.
- Packing_problem type Problem106784003.
- Packing_problem type Problem114410605.
- Packing_problem type Puzzle106784639.
- Packing_problem type Question106783768.
- Packing_problem type State100024720.
- Packing_problem type Subject106599788.
- Packing_problem type TilingPuzzles.
- Packing_problem comment "Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real life packaging, storage and transportation issues.".
- Packing_problem label "Packing problem".
- Packing_problem sameAs m.01f68j.
- Packing_problem sameAs Packing_problem.
- Packing_problem wasDerivedFrom Packing_problem?oldid=604725254.
- Packing_problem depiction Circle_packing_(hexagonal).svg.
- Packing_problem isPrimaryTopicOf Packing_problem.