DBpedia 2015-04

Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Packing_problems> ?p ?o }

Showing triples 1 to 29 of 29 with 100 triples per page.

Packing_problems 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_problems thumbnail Circle_packing_(hexagonal).svg?width=300.
Packing_problems wikiPageExternalLink CircleChallenge.
Packing_problems wikiPageExternalLink BoxPacking.
Packing_problems wikiPageExternalLink overview.
Packing_problems wikiPageExternalLink Packing.html.
Packing_problems wikiPageExternalLink SquarePacking.html.
Packing_problems wikiPageExternalLink rectanglepacker.aspx.
Packing_problems wikiPageExternalLink www.packomania.com.
Packing_problems wikiPageExternalLink packing.html.
Packing_problems wikiPageID "213003".
Packing_problems wikiPageRevisionID "637581357".
Packing_problems title "Klarner's Theorem".
Packing_problems title "de Bruijn's Theorem".
Packing_problems urlname "KlarnersTheorem".
Packing_problems urlname "deBruijnsTheorem".
Packing_problems subject Category:Packing_problems.
Packing_problems 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_problems label "Packing problems".
Packing_problems label "パッキング問題".
Packing_problems label "채우기 문제".
Packing_problems sameAs パッキング問題.
Packing_problems sameAs 채우기_문제.
Packing_problems sameAs m.01f68j.
Packing_problems sameAs Q3851477.
Packing_problems sameAs Q3851477.
Packing_problems wasDerivedFrom Packing_problems?oldid=637581357.
Packing_problems depiction Circle_packing_(hexagonal).svg.
Packing_problems isPrimaryTopicOf Packing_problems.